conftrace_

Ali Jadbabaie

38 papers · 2005–2026 · 8 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+14 more ↓ 🐣 Hot Topic Early Bird 🌍 Conference Polyglot (7) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🏃 Academic Marathon (20)
🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🤝 Dynamic Duo (14) 👑 Triple Crown 🔬 Deep Specialist (10) 🏆 Keyword Champion (4) 🚀 Conference Pioneer Prolific Year (5) 🗃️ Keyword Collector (131) 📈 Trend Setter The Questioner (2) 💎 Century Club (37) 🔥 Unstoppable (8)

Conferences

NIPS (13) ICLR (7) ICML (7) AISTATS (3) COLT (3) L4DC (2) RSS (2) ALT (1)

Papers

On the Role of Transformer Feed-Forward Layers in Nonlinear In-Context Learning ALT 2026 On the Emergence of Position Bias in Transformers ICML 2025 Fast Tensor Completion via Approximate Richardson Iteration ICML 2025 Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNs ICLR 2025 The Pitfalls of Imitation Learning when Actions are Continuous COLT 2025 How to Escape Sharp Minima with Random Perturbations ICML 2024 On the Role of Attention Masks and LayerNorm in Transformers NIPS 2024 Linear attention is (maybe) all you need (to understand Transformer optimization) ICLR 2024 Demystifying Oversmoothing in Attention-Based Graph Neural Networks NIPS 2023 Convex and Non-convex Optimization Under Generalized Smoothness NIPS 2023 Provable Guarantees for Generative Behavior Cloning: Bridging Low-Level Stability and High-Level Behavior NIPS 2023 Convergence of Adam Under Relaxed Assumptions NIPS 2023 Model Predictive Control via On-Policy Imitation Learning L4DC 2023 A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks ICLR 2023 On Convergence of Gradient Descent Ascent: A Tight Local Analysis ICML 2022 Time Varying Regression with Hidden Linear Dynamics L4DC 2022 Neural Network Weights Do Not Converge to Stationary Points: An Invariant Measure Perspective ICML 2022 Beyond Worst-Case Analysis in Stochastic Approximation: Moment Estimation Improves Instance Complexity ICML 2022 Open Problem: Can Single-Shuffle SGD be Better than Reshuffling SGD and GD? COLT 2021 Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization NIPS 2021 Estimation of Skill Distribution from a Tournament NIPS 2020 FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization AISTATS 2020 Robust Federated Learning: The Case of Affine Distribution Shifts NIPS 2020 Why Gradient Clipping Accelerates Training: A Theoretical Justification for Adaptivity ICLR 2020 Complexity of Finding Stationary Points of Nonconvex Nonsmooth Functions ICML 2020 Are deep ResNets provably better than linear predictors? NIPS 2019 Efficient Nonconvex Empirical Risk Minimization via Adaptive Sample Size Methods AISTATS 2019 Efficiently testing local optimality and escaping saddles for ReLU networks ICLR 2019 Small ReLU networks are powerful memorizers: a tight analysis of memorization capacity NIPS 2019 Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard COLT 2019 Small nonlinearities in activation functions create bad local minima in neural networks ICLR 2019 Global Optimality Conditions for Deep Neural Networks ICLR 2018 Escaping Saddle Points in Constrained Optimization NIPS 2018 Direct Runge-Kutta Discretization Achieves Acceleration NIPS 2018 Online Optimization : Competing with Dynamic Comparators AISTATS 2015 Online Learning of Dynamic Parameters in Social Networks NIPS 2013 Bearing-Only Control Laws For Balanced Circular Formations of Ground Robots RSS 2008 Vision-based Distributed Coordination and Flocking of Multi-agent Systems RSS 2005