Institution profile

Alberta Machine Intelligence Institute

Academic institutionnorthamerica · ca
Official website
Research library124linked papers
Opportunities0open roles
Selected work

Representative Papers

Application-Driven Innovation in Machine Learning

Mar 26, 2024International Conference on Machine Learning

Application-driven machine learning (ML) research has been systematically undervalued in academia, leading to a growing disconnect between algorithmic innovation and real-world needs; this marginalization is reinforced by structural biases in peer review, faculty hiring, and pedagogy. Method: This paper introduces, for the first time, a formally defined “application-driven ML research paradigm,” elucidating its complementary relationship with the dominant methodology-driven paradigm. Drawing on interdisciplinary frameworks from education theory, research governance, and ML practice—and substantiated by empirical case studies and institutional critique—it diagnoses three systemic barriers hindering such research. Contribution/Results: The core contribution is a set of actionable, process-level interventions to reform academic evaluation systems, grounded in both theoretical analysis and pragmatic implementation pathways. These proposals have already catalyzed curricular reforms in AI education and adjustments to national funding review criteria across multiple universities, fostering cross-domain collaboration and methodological feedback loops between application domains and core ML research.

22 citations2 influentialRead paper

Glocal Smoothness: Line Search can really help!

Jun 14, 2025

Classical iteration complexity analyses for first-order optimization methods rely on global Lipschitz continuity of the gradient, failing to exploit beneficial local smoothness—where the Lipschitz constant varies across regions—and thus incur unnecessary conservatism. Method: We introduce “glocal smoothness,” a novel structural assumption that simultaneously captures both global and local smoothness properties of the objective function—without dependence on algorithmic trajectories—thereby enabling trajectory-agnostic complexity bounds governed solely by intrinsic function constants. Contribution/Results: Under glocal smoothness, we establish improved iteration complexity for gradient descent with backtracking line search—surpassing that of fixed-step accelerated methods. Moreover, we provide a unified, refined convergence analysis for diverse algorithms including Polyak’s step size, adaptive gradient descent (AdGD), coordinate descent, stochastic and deterministic gradient methods, and nonlinear conjugate gradient, yielding significantly tighter complexity bounds across all cases.

2 citationsRead paper
Recent publications

Latest Papers