Stochastic Convex Optimization

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Annual Conference Computational Learning Theory

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast Convergence Rates for Excess Regularized Risk with Application to SVM

  2008cited by this paper
• Fast Rates for Regularized Objectives

  2008cited by this paper
• On the Generalization Ability of Online Strongly Convex Programming Algorithms

  2008cited by this paper
• Online learning: theory, algorithms and applications (למידה מקוונת.)

  2007cited by this paper
• Logarithmic regret algorithms for online convex optimization

  2006influential reference
• STABILITY RESULTS IN LEARNING THEORY

  2005cited by this paper
• Covering a Ball with Smaller Equal Balls in ℝn

  2005cited by this paper
• Distance-Based Classification with Lipschitz Functions

  2004cited by this paper
• Online Convex Programming and Generalized Infinitesimal Gradient Ascent

  2003cited by this paper
• Learn

  2002influential reference
• Stability and Generalization

  2002influential reference
• On the generalization ability of on-line learning algorithms

  2001cited by this paper
• The Nature of Statistical Learning Theory

  2000influential reference
• Statistical learning theory

  1998influential reference
• Scale-sensitive dimensions, uniform convergence, and learnability

  1993cited by this paper
• Equivalence of models for polynomial learnability

  1988cited by this paper
• ON CONVERGENCE OF STOCHASTIC PROCESSES

  1962cited by this paper

• All ERMs Can Fail in Stochastic Convex Optimization Lower Bounds in Linear Dimension

  2026influential citation
• Inverse Mixed-Integer Programming: Learning Constraints then Objective Functions

  2025influential citation
• Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates

  2025cites this paper
• Data Selection for ERMs

  2025cites this paper
• Bias-Variance Trade-off for Clipped Stochastic First-Order Methods: From Bounded Variance to Infinite Mean

  2025cites this paper
• A Systems-Theoretic View on the Convergence of Algorithms under Disturbances

  2025cites this paper
• Bant: Byzantine Antidote via Trial Function and Trust Scores

  2025cites this paper
• Accelerated stochastic first-order method for convex optimization under heavy-tailed noise

  2025cites this paper
• Efficient Convex Optimization for Bosonic State Tomography

  2025cites this paper
• How hard is learning to cut? Trade-offs and sample complexity

  2025cites this paper
• A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions

  2025cites this paper
• Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation

  2025cites this paper
• Spherical dimension

  2025cites this paper
• UCB-type Algorithm for Budget-Constrained Expert Learning

  2025cites this paper
• Diffusion-DFL: Decision-focused Diffusion Models for Stochastic Optimization

  2025cites this paper
• VC Theory for Inventory Policies

  2024cites this paper
• Differentially Private Optimization with Sparse Gradients

  2024cites this paper
• Low-Resource Machine Translation through the Lens of Personalized Federated Learning

  2024cites this paper
• On Reductions and Representations of Learning Problems in Euclidean Spaces

  2024cites this paper
• Faster Algorithms for User-Level Private Stochastic Convex Optimization

  2024cites this paper
• Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions

  2024cites this paper
• The Sample Complexity of Gradient Descent in Stochastic Convex Optimization

  2024influential citation
• Convex SGD: Generalization Without Early Stopping

  2024cites this paper
• Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems

  2024cites this paper
• Private Heterogeneous Federated Learning Without a Trusted Server Revisited: Error-Optimal and Communication-Efficient Algorithms for Convex Losses

  2024cites this paper
• Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions

  2024influential citation
• Federated Learning Can Find Friends That Are Advantageous

  2024cites this paper
• Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming

  2024influential citation
• Efficient Online Unlearning via Hessian-Free Recollection of Individual Data Statistics

  2024cites this paper
• Efficient Sparse Least Absolute Deviation Regression With Differential Privacy

  2024cites this paper
• Localized Distributional Robustness in Submodular Multi-Task Subset Selection

  2024cites this paper
• Fault Tolerant ML: Efficient Meta-Aggregation and Synchronous Training

  2024cites this paper
• Federated Learning Can Find Friends That Are Beneficial

  2024cites this paper
• Efficient Algorithms for Empirical Group Distributional Robust Optimization and Beyond

  2024cites this paper
• Decentralized Personalized Federated Learning

  2024cites this paper
• Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-Tailed Noise and Power of Symmetry

  2024cites this paper
• An Improved Analysis of the Clipped Stochastic subGradient Method under Heavy-Tailed Noise

  2024cites this paper
• Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization

  2024cites this paper
• Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing

  2024cites this paper
• Differentially Private Deep Model-Based Reinforcement Learning

  2024cites this paper
• Demystifying SGD with Doubly Stochastic Gradients

  2024cites this paper
• Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups

  2024cites this paper
• Bregman Proximal Method for Efficient Communications under Similarity

  2023cites this paper
• Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses

  2023cites this paper
• The Sample Complexity Of ERMs In Stochastic Convex Optimization

  2023cites this paper
• Delayed Stochastic Algorithms for Distributed Weakly Convex Optimization

  2023cites this paper
• Demystifying the Myths and Legends of Nonconvex Convergence of SGD

  2023cites this paper
• Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization

  2023cites this paper
• Robust Stochastic Optimization via Gradient Quantile Clipping

  2023cites this paper
• Analysis of the Memorization and Generalization Capabilities of AI Agents: are Continual Learners Robust?

  2023cites this paper
• Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks

  2023cites this paper
• A Deep Learning Perspective on Network Routing

  2023cites this paper
• Primal-Dual Continual Learning: Stability and Plasticity through Lagrange Multipliers

  2023influential citation
• Credal Learning: Weakly Supervised Learning from Credal Sets

  2023cites this paper
• Information Theoretic Lower Bounds for Information Theoretic Upper Bounds

  2023influential citation
• Gradient Descent with Linearly Correlated Noise: Theory and Applications to Differential Privacy

  2023cites this paper
• Buying Information for Stochastic Optimization

  2023cites this paper
• Time-Independent Information-Theoretic Generalization Bounds for SGLD

  2023cites this paper
• Primal Dual Continual Learning: Balancing Stability and Plasticity through Adaptive Memory Allocation

  2023influential citation
• Algorithmic High-Dimensional Robust Statistics

  2023cites this paper
• DOTE: Rethinking (Predictive) WAN Traffic Engineering

  2023cites this paper
• Generalization as Dynamical Robustness-The Role of Riemannian Contraction in Supervised Learning

  2023cites this paper
• The Ideal Continual Learner: An Agent That Never Forgets

  2023cites this paper
• On the Concentration of the Minimizers of Empirical Risks

  2023cites this paper
• A Comprehensive Survey of Forgetting in Deep Learning Beyond Continual Learning

  2023cites this paper
• Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learning

  2023cites this paper
• Delayed Algorithms for Distributed Stochastic Weakly Convex Optimization

  2023cites this paper
• How to DP-fy ML: A Practical Guide to Machine Learning with Differential Privacy

  2023cites this paper
• Convergence of Gradient Descent with Linearly Correlated Noise and Applications to Differentially Private Learning

  2023cites this paper
• On User-Level Private Convex Optimization

  2023influential citation
• Tight Bounds for Machine Unlearning via Differential Privacy

  2023cites this paper
• Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization

  2023cites this paper
• Sample-Conditioned Hypothesis Stability Sharpens Information-Theoretic Generalization Bounds

  2023cites this paper
• Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization

  2022cites this paper
• Stability Based Generalization Bounds for Exponential Family Langevin Dynamics

  2022cites this paper
• Appendix for "Differentially Private SGDA for Minimax Problems" A Motivating Examples

  2022cites this paper
• PAC-Bayesian Learning of Optimization Algorithms

  2022cites this paper
• A One-Shot Framework for Distributed Clustered Learning in Heterogeneous Environments

  2022cites this paper
• Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter

  2022cites this paper
• Stability and Risk Bounds of Iterative Hard Thresholding

  2022influential citation
• Private Stochastic Optimization in the Presence of Outliers: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses

  2022cites this paper
• Private optimization in the interpolation regime: faster rates and hardness results

  2022influential citation
• Generalization Bounds for Stochastic Gradient Descent via Localized ε-Covers

  2022cites this paper
• Boosting the Confidence of Generalization for L2-Stable Randomized Learning Algorithms

  2022influential citation
• Distributed Online Stochastic-Constrained Convex Optimization With Bandit Feedback

  2022cites this paper
• Algorithms that Approximate Data Removal: New Results and Limitations

  2022cites this paper
• Uniform Stability for First-Order Empirical Risk Minimization

  2022cites this paper
• Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss

  2022cites this paper
• Factored DRO: Factored Distributionally Robust Policies for Contextual Bandits

  2022cites this paper
• Uniform Convergence and Generalization for Nonconvex Stochastic Minimax Problems

  2022influential citation
• Task-level Differentially Private Meta Learning

  2022cites this paper
• Private Convex Optimization via Exponential Mechanism

  2022influential citation
• Langevin Diffusion: An Almost Universal Algorithm for Private Euclidean (Convex) Optimization

  2022cites this paper
• Stability vs Implicit Bias of Gradient Methods on Separable Data and Beyond

  2022cites this paper
• To Federate or Not To Federate: Incentivizing Client Participation in Federated Learning

  2022cites this paper
• The power of first-order smooth optimization for black-box non-smooth problems

  2022cites this paper
• Maximizing Global Model Appeal in Federated Learning

  2022influential citation
• On the relations of stochastic convex optimization problems with empirical risk minimization problems on $p$-norm balls

  2022influential citation
• Vaidya's method for convex stochastic optimization in small dimension

  2022cites this paper
• On the Importance of Gradient Norm in PAC-Bayesian Bounds

  2022cites this paper