No article text was recorded for this version.
randomized smoothing (differentiable surrogate approximation)
Version 1 of 140 papers47 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On Stochastic Gradient and Subgradient Methods with Adaptive Steplength Sequences
- Blog: Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
- Blog: Inexact zeroth-order nonsmooth and nonconvex stochastic composite optimization and applications
- Blog: Zeroth-Order Methods for Nondifferentiable, Nonconvex, and Hierarchical Federated Optimization
- Blog: Linearly Constrained Bilevel Optimization: A Smoothed Implicit Gradient Approach
- Blog: A Unified Approach to Submodular Maximization Under Noise
- Blog: Provably Correct Automatic Sub-Differentiation for Qualified Programs
- Blog: On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions
- Blog: The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization
- Blog: The power of first-order smooth optimization for black-box non-smooth problems
- Blog: Stochastic Adversarial Noise in the "Black Box" Optimization Problem
- Blog: Spectral risk-based learning using unbounded losses
- Blog: The power of first-order smooth optimization for black-box non-smooth problems
- Blog: An Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization
- Blog: User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Rates
- Blog: Differentially private algorithms for linear queries via stochastic convex optimization
- Blog: Private Zeroth-Order Nonsmooth Nonconvex Optimization
- Blog: A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions
- Blog: A zeroth order method for stochastic weakly convex optimization
- Blog: A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
- Blog: Linearly Constrained Bilevel Optimization: A Smoothed Implicit Gradient Approach
- Blog: Learning Optimally Sparse Support Vector Machines
- Blog: Non-smooth setting of stochastic decentralized convex optimization problem over time-varying Graphs
- Blog: Closing the Computational-Statistical Gap in Best Arm Identification for Combinatorial Semi-bandits
- Blog: Constraint-Aware Flow Matching via Randomized Exploration
- Blog: Accelerated Zeroth-order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance
- Blog: A Randomized Zeroth-Order Hierarchical Framework for Heterogeneous Federated Learning
- Blog: Bundled Gradients through Contact via Randomized Smoothing
- Blog: Asynchronous Message-Passing and Zeroth-Order Optimization Based Distributed Learning With a Use-Case in Resource Allocation in Communication Networks
- Blog: An Optimal Structured Zeroth-order Algorithm for Non-smooth Optimization
- Blog: Complexity of Highly Parallel Non-Smooth Convex Optimization
- Blog: Quantum Algorithms for Non-smooth Non-convex Optimization
- Blog: Randomized Smoothing for Stochastic Optimization
- Blog: Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
- Blog: Faster Algorithms for User-Level Private Stochastic Convex Optimization
- Blog: Optimal Algorithms for Non-Smooth Distributed Optimization in Networks
- Blog: Distributed Gradient Tracking Methods with Guarantees for Computing a Solution to Stochastic MPECs
- Blog: Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization
- Blog: A new computational framework for log-concave density estimation
- Blog: Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization
History & citation
Current · Permanent link
- This direction split from Randomized Smoothing for Non-Smooth Optimization (75% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_randomized_smoothing_differentiable_surr_7cd5ea55,
title = {randomized smoothing (differentiable surrogate approximation)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/randomized-smoothing-differentiable-surrogate-approximation/rdr_7cd5ea5556034147bc5c606d8593a001},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_randomized_smoothing_differentiable_surr_7cd5ea55_v1,
title = {randomized smoothing (differentiable surrogate approximation)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/randomized-smoothing-differentiable-surrogate-approximation/rdr_7cd5ea5556034147bc5c606d8593a001/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}