Continuous Optimization
4,424 papers
Papers per year
1
2
2
7
16
23
29
27
39
46
78
150
173
157
189
225
261
393
371
395
418
423
545
420
34
'5
'10
'15
'20
'25
Papers
Nesting Particle Filters for Experimental Design in Dynamical Systems
ICML 2024
Newton Losses: Using Curvature Information for Learning with Differentiable Algorithms
NeurIPS 2024
No Dimensional Sampling Coresets for Classification
ICML 2024
No Double Descent in Principal Component Regression: A High-Dimensional Analysis
ICML 2024
Noisy Dual Mirror Descent: A Near Optimal Algorithm for Jointly-DP Convex Resource Allocation
NeurIPS 2024
Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
NeurIPS 2024
Non-Convex Joint Community Detection and Group Synchronization via Generalized Power Method
AISTATS 2024
Nonconvex Multiview Subspace Clustering Framework with Efficient Method Designs and Theoretical Analysis
IJCAI 2024
Non-geodesically-convex optimization in the Wasserstein space
NeurIPS 2024
Nonlinear Filtering with Brenier Optimal Transport Maps
ICML 2024
Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates
ICML 2024
Novel Spectral Algorithms for the Partial Credit Model
ICML 2024
Numerically Stable Sparse Gaussian Processes via Minimum Separation using Cover Trees
JMLR 2024
Offline Multi-Objective Optimization
ICML 2024
Omnipredictors for regression and the approximate rank of convex functions
COLT 2024
OmniSDF: Scene Reconstruction using Omnidirectional Signed Distance Functions and Adaptive Binoctrees
CVPR 2024
On a Neural Implementation of Brenier’s Polar Factorization
ICML 2024
On Efficient and Scalable Computation of the Nonparametric Maximum Likelihood Estimator in Mixture Models
JMLR 2024
One-Shot Strategic Classification Under Unknown Costs
ICML 2024
Online Control in Population Dynamics
NeurIPS 2024
Online Learning under Budget and ROI Constraints via Weak Adaptivity
ICML 2024
Online Markov Decision Processes Configuration with Continuous Decision Space
AAAI 2024
Online Newton Method for Bandit Convex Optimisation Extended Abstract
COLT 2024
On Partial Optimal Transport: Revising the Infeasibility of Sinkhorn and Efficient Gradient Methods
AAAI 2024
On the Complexity of Finite-Sum Smooth Optimization under the Polyak–Łojasiewicz Condition
ICML 2024