A Unified Approach to Controlling Implicit Regularization via Mirror Descent
Fuente:
arXiv
Saved in:
| Main Authors: | Sun, Haoyuan, Gatmiry, Khashayar, Ahn, Kwangjun, Azizan, Navid |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Meta-Learning for Adaptive Control with Automated Mirror Descent
by: Tang, Sunbochen, et al.
Published: (2024)
by: Tang, Sunbochen, et al.
Published: (2024)
Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection
by: Julistiono, Addison Kristanto, et al.
Published: (2024)
by: Julistiono, Addison Kristanto, et al.
Published: (2024)
Adversarial Online Learning with Temporal Feedback Graphs
by: Gatmiry, Khashayar, et al.
Published: (2024)
by: Gatmiry, Khashayar, et al.
Published: (2024)
On the Role of Transformer Feed-Forward Layers in Nonlinear In-Context Learning
by: Sun, Haoyuan, et al.
Published: (2025)
by: Sun, Haoyuan, et al.
Published: (2025)
Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)
by: Jalota, Devansh, et al.
Published: (2023)
Computing Optimal Regularizers for Online Linear Optimization
by: Gatmiry, Khashayar, et al.
Published: (2024)
by: Gatmiry, Khashayar, et al.
Published: (2024)
ORFit: One-Pass Learning via Bridging Orthogonal Gradient Descent and Recursive Least-Squares
by: Min, Youngjae, et al.
Published: (2022)
by: Min, Youngjae, et al.
Published: (2022)
Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?
by: Gatmiry, Khashayar, et al.
Published: (2024)
by: Gatmiry, Khashayar, et al.
Published: (2024)
High-accuracy and dimension-free sampling with diffusions
by: Gatmiry, Khashayar, et al.
Published: (2026)
by: Gatmiry, Khashayar, et al.
Published: (2026)
When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?
by: Chen, Yuansi, et al.
Published: (2023)
by: Chen, Yuansi, et al.
Published: (2023)
Constrained Online Decision-Making: A Unified Framework
by: Hu, Haichen, et al.
Published: (2025)
by: Hu, Haichen, et al.
Published: (2025)
Reverse Flow Matching: A Unified Framework for Online Reinforcement Learning with Diffusion and Flow Policies
by: Li, Zeyang, et al.
Published: (2026)
by: Li, Zeyang, et al.
Published: (2026)
Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)
by: Gatmiry, Khashayar, et al.
Published: (2024)
Simplicity Bias via Global Convergence of Sharpness Minimization
by: Gatmiry, Khashayar, et al.
Published: (2024)
by: Gatmiry, Khashayar, et al.
Published: (2024)
On the Effect of Regularization in Policy Mirror Descent
by: Kleuker, Jan Felix, et al.
Published: (2025)
by: Kleuker, Jan Felix, et al.
Published: (2025)
Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
by: Soma, Tasuku, et al.
Published: (2022)
by: Soma, Tasuku, et al.
Published: (2022)
LMI-Net: Linear Matrix Inequality--Constrained Neural Networks via Differentiable Projection Layers
by: Tang, Sunbochen, et al.
Published: (2026)
by: Tang, Sunbochen, et al.
Published: (2026)
Adam with model exponential moving average is effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)
by: Ahn, Kwangjun, et al.
Published: (2024)
HardNet: Hard-Constrained Neural Networks with Universal Approximation Guarantees
by: Min, Youngjae, et al.
Published: (2024)
by: Min, Youngjae, et al.
Published: (2024)
Safe Multi-Agent Reinforcement Learning with Convergence to Generalized Nash Equilibrium
by: Li, Zeyang, et al.
Published: (2024)
by: Li, Zeyang, et al.
Published: (2024)
Stability and Robustness via Regularization: Bandit Inference via Regularized Stochastic Mirror Descent
by: Halder, Budhaditya, et al.
Published: (2026)
by: Halder, Budhaditya, et al.
Published: (2026)
Approximation of Log-Partition Function in Policy Mirror Descent Induces Implicit Regularization for LLM Post-Training
by: Xu, Zhenghao, et al.
Published: (2026)
by: Xu, Zhenghao, et al.
Published: (2026)
HardFlow: Hard-Constrained Sampling for Flow-Matching Models via Trajectory Optimization
by: Li, Zeyang, et al.
Published: (2025)
by: Li, Zeyang, et al.
Published: (2025)
Personalized Collaborative Learning with Affinity-Based Variance Reduction
by: Zhang, Chenyu, et al.
Published: (2025)
by: Zhang, Chenyu, et al.
Published: (2025)
Mirror, Mirror of the Flow: How Does Regularization Shape Implicit Bias?
by: Jacobs, Tom, et al.
Published: (2025)
by: Jacobs, Tom, et al.
Published: (2025)
Implicit Bias and Convergence of Matrix Stochastic Mirror Descent
by: Akhtiamov, Danil, et al.
Published: (2026)
by: Akhtiamov, Danil, et al.
Published: (2026)
What does guidance do? A fine-grained analysis in a simple setting
by: Chidambaram, Muthu, et al.
Published: (2024)
by: Chidambaram, Muthu, et al.
Published: (2024)
General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)
by: Ahn, Kwangjun, et al.
Published: (2024)
Does SGD really happen in tiny subspaces?
by: Song, Minhak, et al.
Published: (2024)
by: Song, Minhak, et al.
Published: (2024)
On the Role of Depth and Looping for In-Context Learning with Task Diversity
by: Gatmiry, Khashayar, et al.
Published: (2024)
by: Gatmiry, Khashayar, et al.
Published: (2024)
ECO: Energy-Constrained Operator Learning for Chaotic Dynamics with Boundedness Guarantees
by: Goertzen, Andrea, et al.
Published: (2025)
by: Goertzen, Andrea, et al.
Published: (2025)
Dion2: A Simple Method to Shrink Matrix in Muon
by: Ahn, Kwangjun, et al.
Published: (2025)
by: Ahn, Kwangjun, et al.
Published: (2025)
Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise
by: Ahn, Kwangjun, et al.
Published: (2024)
by: Ahn, Kwangjun, et al.
Published: (2024)
Implicit Regularization for Tubal Tensor Factorizations via Gradient Descent
by: Karnik, Santhosh, et al.
Published: (2024)
by: Karnik, Santhosh, et al.
Published: (2024)
How to escape sharp minima with random perturbations
by: Ahn, Kwangjun, et al.
Published: (2023)
by: Ahn, Kwangjun, et al.
Published: (2023)
Efficient Joint Prediction of Multiple Future Tokens
by: Ahn, Kwangjun, et al.
Published: (2025)
by: Ahn, Kwangjun, et al.
Published: (2025)
HardNet++: Nonlinear Constraint Enforcement in Neural Networks
by: Goertzen, Andrea, et al.
Published: (2026)
by: Goertzen, Andrea, et al.
Published: (2026)
Understanding the Implicit Regularization of Gradient Descent in Over-parameterized Models
by: Ma, Jianhao, et al.
Published: (2025)
by: Ma, Jianhao, et al.
Published: (2025)
A Mirror Descent Perspective of Smoothed Sign Descent
by: Wang, Shuyang, et al.
Published: (2024)
by: Wang, Shuyang, et al.
Published: (2024)
SketchOGD: Memory-Efficient Continual Learning
by: Min, Youngjae, et al.
Published: (2023)
by: Min, Youngjae, et al.
Published: (2023)
Similar Items
-
Meta-Learning for Adaptive Control with Automated Mirror Descent
by: Tang, Sunbochen, et al.
Published: (2024) -
Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection
by: Julistiono, Addison Kristanto, et al.
Published: (2024) -
Adversarial Online Learning with Temporal Feedback Graphs
by: Gatmiry, Khashayar, et al.
Published: (2024) -
On the Role of Transformer Feed-Forward Layers in Nonlinear In-Context Learning
by: Sun, Haoyuan, et al.
Published: (2025) -
Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)