Optimisation & control
2,908 studies179 in 7 days1,190 in 30 days
Filters
Latest
2,908 studies
- BIBO stability in infinite dimensions: extensions and limitations of finite-dimensional theory
- Matching Upper and Lower Bounds for Higher-Order Nonconvex Finite-Sum Optimization
- Sign Propagation of Principal Minors in Fully Semimonotone Matrices and Stone's Conjecture
- Optimal Selling of Defaultable Assets using the Distribution Builder
- Readiness Barrier Functions: Forward-Invariant Control Authority for Overactuated Multirotor Allocation
- Learning Generative Dynamics with Soft Path-Law Constraints: A McKean-Vlasov FBSDE Approach
- Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces
- Quantum-Classical Hybrid Methods for Optimization: Lessons from Classical Decomposition
- Newton-Based Methods for Bilevel Optimization Beyond Lower-Level Strong Convexity
- Controllability of polynomial systems is undecidable and not recursively enumerable
- Next Best Action: Causal Constrained Offline RL for Business Action Targeting
- Tight lower bounds for Lipschitz geodesically convex optimization on hyperbolic space
- Training with ML-labeled Data via Stochastic First- and Zeroth-Order Optimization
- Gradient descent reaches arbitrary accuracy in a fixed number of large steps on multiclass logistic regression
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Polar Switch: Fast Muon Orthogonalization with Polynomial Circuits
- Deep Pontryagin Learning for Continuous-Time Stochastic Control with Jumps
- Gradient-Hessian Query Tradeoffs: Matching Lower Bounds in Logarithmic Dimension
- Dimension-Optimal Dynamic Regret in Exp-Concave Online Learning
- Optimal Feature-Based Newsvendor Policies under Censored Demand
- Matching Randomized First-Order Bounds for Higher-Order Smooth Nonconvex Optimization
- Matching Randomized Bounds for Finite-Sum Nonconvex-Concave Optimization
- Matching Complexity for Second-Order Stationary Point with Sample Reuse
- Matching Full-Hessian Oracle Complexity for Nonconvex--Strongly-Concave Minimax Optimization
- The Minimax Cost of Smoothness in Fully First-Order Stochastic Bilevel Optimization