conftrace_

lipschitz function

22 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) convex optimization (1321) single index model (13) gradient estimator (59) lipchitz function (4) bandit convex optimization (23) multi-armed bandit (1098) support vector machine (978) stochastic optimization (1060)

Papers

Certified private data release for sparse Lipschitz functions AISTATS 2024
Agnostic Active Learning of Single Index Models with Linear Sample Complexity COLT 2024
Corruption-Robust Lipschitz Contextual Search ALT 2024
When Does Optimizing a Proper Loss Yield Calibration? NIPS 2023
Universality and Limitations of Prompt Tuning NIPS 2023
On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions ICML 2022
A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions NIPS 2022
Differentially Private Pairwise Learning Revisited IJCAI 2021
Stochastic Bias-Reduced Gradient Methods NIPS 2021
Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss COLT 2021
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates NIPS 2021
Comparator-Adaptive Convex Bandits NIPS 2020
Depth Separations in Neural Networks: What is Actually Being Separated? COLT 2019
Contextual Pricing for Lipschitz Buyers NIPS 2018
Global optimization of Lipschitz functions ICML 2017
Bandits with Movement Costs and Adaptive Pricing COLT 2017
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback JMLR 2017
Optimistic Bandit Convex Optimization NIPS 2016
Matrix Completion Under Monotonic Single Index Models NIPS 2015
The Hedge Algorithm on a Continuum ICML 2015
Incorporating Functional Knowledge in Neural Networks JMLR 2009
Distance-Based Classification with Lipschitz Functions JMLR 2004