archive
Every paper Pith has read. Search by title, abstract, or pith.
2292 papers in math.OC · page 7
-
Mirror descent computes exact barycenters for discrete and continuous measures
A Unified Approach for Computing Wasserstein Barycenters of Discrete and Continuous Measures
-
Random spectra match Muon on GPT-2 training
Muon is Not That Special: Random or Inverted Spectra Work Just as Well
-
Separable estimators tighten relaxations beyond McCormick
Relaxation via Separable Estimators: Arithmetic and Implementation
-
Quotient JSR tightens convergence bound for deflated Q-value iteration
Switching-Geometry Analysis of Deflated Q-Value Iteration
-
Projected JSR can be strictly smaller than γ for deflated Q-VI
Switching-Geometry Analysis of Deflated Q-Value Iteration
-
Single network solves optimal transport via proximal fixed points
Implicit Neural Optimal Transport via Fixed-Point Optimization
-
Gradient descent reaches only global minima in wide shallow nets
On the global convergence of gradient descent for wide shallow models with bounded nonlinearities
-
Decentralized MPC with safe sets guarantees multi-agent collision avoidance
Decentralized Contingency MPC based on Safe Sets for Nonlinear Multi-agent Collision Avoidance
-
Exponential bound proven for LCP sufficient-matrix handicaps
Handicap reduction for linear complementarity problems
-
Natural policy gradient equals smoothed policy iteration
Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework
-
Closed-form spectral formulas estimate density ratios from moments
A Spectral Framework for Closed-Form Relative Density Estimation
-
New moves link all incomplete tournament schedules
Novel neighborhood structures for incomplete round robin sports tournaments
-
Frank-Wolfe lower bound matches upper bound on p-uniformly convex sets
Curvature-Dependent Lower Bounds for Frank-Wolfe
-
Frank-Wolfe rates proven tight at T to the minus p over p-1
Curvature-Dependent Lower Bounds for Frank-Wolfe
-
Riemannian L-BFGS handles Euclidean bounds on manifolds
A Riemannian quasi-Newton algorithm for optimization with Euclidean bounds
-
LP methods give exact set tolerances for MST
Computation of Set Tolerances with Applications to the Minimum Spanning Tree Problem
-
8/3 approximation for matroid-constrained randomized vertex-cover interdiction
Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
-
Backstepping observer stabilizes error in blood flow cascade models
Observer Design for a Class of ODE -- Continuum-PDE Cascade Systems Inspired by a Control-Theoretic Model of Large-Scale Arterial Networks of Blood Flow
-
Bound certifies any learned controller for unknown linear systems
A PAC-Bayes Approach for Controlling Unknown Linear Discrete-time Systems
-
PAC-Bayes bound guarantees controller performance on unknown systems
A PAC-Bayes Approach for Controlling Unknown Linear Discrete-time Systems
-
Youla-Kucera adds channels for cascaded MPC and offset-free control
Hierarchical 2-degree-of-freedom control combining Youla-Kucera parameterization and model predictive control
-
LLM writes branching rules that speed up MILP solvers
LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs
-
Attention fuses LEO measurements for spectrum cartography
Learning-Based Spectrum Cartography in Low Earth Orbit Satellite Networks: An Overview
-
PowerStep matches Adam on Transformers with half the optimizer memory
PowerStep: Memory-Efficient Adaptive Optimization via $\ell_p$-Norm Steepest Descent
-
Signature method gives sublinear regret for path-dependent bandits
Signature Approach for Contextual Bandits with Nonlinear and Path-dependent Rewards
-
Randomized subspaces match exact bilevel convergence rate
BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization
-
BROS matches exact bilevel convergence while cutting peak memory by up to 45%
BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization
-
XP algorithms and W[1]-hardness classify stationarity testing for PA functions in fixed d
Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
-
Dimension parameter splits stationarity testing into XP and W[1]-hard cases
Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
-
Phased algorithm achieves d sqrt(T) regret for sparse linear bandits
Learning to Sparsify Stochastic Linear Bandits
-
Transformation stabilizes ODE-wave cascade with boundary disturbances
Stabilization for a Cascaded ODE-Wave Equation with Boundary Nonlinear Disturbances
-
Same-optimizer solutions form connected sets in wide ReLU nets
Optimizer-Induced Mode Connectivity: From AdamW to Muon
-
Chebyshev center selects PINN update directions
Chebyshev Center-Based Direction Selection for Multi-Objective Optimization and Training PINNs
-
Order-gap tracks distance to settled state in learning systems
Consolidation-Expansion Operator Mechanics:A Unified Framework for Adaptive Learning
-
Order-gap measure gives stopping rule for adaptive learning
Consolidation-Expansion Operator Mechanics:A Unified Framework for Adaptive Learning
-
Backward LPs yield optimal recommendations to strategic agents
Action Recommendations for Sequentially Rational Strategic Agents
-
Vector measurements speed up Bayesian optimization
Bayesian Optimization with Structured Measurements: A Vector-Valued RKHS Framework
-
Probabilistic sets let Gaussian processes safely explore nonlinear systems
Safe Exploration for Nonlinear Processes Using Online Gaussian Process Learning
-
Nonlinear correction fixes RNA-seq sample biases
Detecting and Correcting Sample-by-Sample Scale Distortion in RNA Sequencing Data
-
Power law model splits Muon and SignSGD into three phases
Phases of Muon: When Muon Eclipses SignSGD
-
Certificates isolate Koopman regression failures by layer
Diagnostic Certificates of Data Quality and Regression Identifiability for Koopman Identification
-
Mean-field SVGD converges in L2 at explicit polynomial rates
Quantitative Local Convergence of Mean-Field Stein Variational Gradient Flow
-
Mobile multiplicative control steers quasilinear parabolic equations to rest
Controllability of quasilinear parabolic equations under multiplicative mobile controls
-
Barrier certificates bound violation risk under stochastic predicates
Barrier Certificates for Uncertain Temporal Specifications
-
Neural predictions warm-start exact LAP solvers for 2x speedups
Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
-
Nonlinear adjoints yield explicit controls for quadruple linear systems
Extended MF-FBSDEs with nonlinear domination-monotonicity conditions and stochastic optimal controls of Linear System with quadruple controls
-
Newton method quadratically solves 0-1 loss quadratic SVM
Newton Method for Soft Quadratic Surface Support Vector Machine with 0-1 Loss Function
-
MI density control for linear systems matches Schrödinger bridges
Mutual Information Optimal Density Control of Linear Systems and Generalized Schr\"{o}dinger Bridges with Reference Refinement
-
Signed directions let async learners converge despite adversaries
Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimates
-
Nonlocal control problems converge to local ones as s to 1 or delta to 0
Localization for nonlocal gradient-based optimal control problems