Saved in:
| Main Author: | Balázs, Gábor |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.15615 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Near-optimal estimates for the $\ell^p$-Lipschitz constants of deep random ReLU neural networks
by: Dirksen, Sjoerd, et al.
Published: (2025)
by: Dirksen, Sjoerd, et al.
Published: (2025)
Holographic functions and neural networks
by: Szegedy, Balazs
Published: (2026)
by: Szegedy, Balazs
Published: (2026)
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)
by: Latafat, Puya, et al.
Published: (2023)
Near-optimal algorithms for private estimation and sequential testing of collision probability
by: Busa-Fekete, Robert, et al.
Published: (2025)
by: Busa-Fekete, Robert, et al.
Published: (2025)
Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)
by: Tamás, Ambrus, et al.
Published: (2024)
On amortizing convex conjugates for optimal transport
by: Amos, Brandon
Published: (2022)
by: Amos, Brandon
Published: (2022)
The Nyström method for convex loss functions
by: Della Vecchia, Andrea, et al.
Published: (2020)
by: Della Vecchia, Andrea, et al.
Published: (2020)
Near-optimal Active Reconstruction
by: Yang, Daniel
Published: (2025)
by: Yang, Daniel
Published: (2025)
A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
by: Lauga, Guillaume
Published: (2026)
by: Lauga, Guillaume
Published: (2026)
Non-geodesically-convex optimization in the Wasserstein space
by: Luu, Hoang Phuc Hau, et al.
Published: (2024)
by: Luu, Hoang Phuc Hau, et al.
Published: (2024)
Strong convexity-guided hyper-parameter optimization for flatter losses
by: Yedida, Rahul, et al.
Published: (2024)
by: Yedida, Rahul, et al.
Published: (2024)
A simple uniformly optimal method without line search for convex optimization
by: Li, Tianjiao, et al.
Published: (2023)
by: Li, Tianjiao, et al.
Published: (2023)
Learning based convex approximation for constrained parametric optimization
by: Liu, Kang, et al.
Published: (2025)
by: Liu, Kang, et al.
Published: (2025)
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity
by: Franks, Cole, et al.
Published: (2021)
by: Franks, Cole, et al.
Published: (2021)
MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
by: Sbihi, Mohammed, et al.
Published: (2024)
by: Sbihi, Mohammed, et al.
Published: (2024)
Optimal convex $M$-estimation via score matching
by: Feng, Oliver Y., et al.
Published: (2024)
by: Feng, Oliver Y., et al.
Published: (2024)
Cubic regularized subspace Newton for non-convex optimization
by: Zhao, Jim, et al.
Published: (2024)
by: Zhao, Jim, et al.
Published: (2024)
Extremal graphical modeling with latent variables via convex optimization
by: Engelke, Sebastian, et al.
Published: (2024)
by: Engelke, Sebastian, et al.
Published: (2024)
Quantum Lipschitz Bandits
by: Yi, Bongsoo, et al.
Published: (2025)
by: Yi, Bongsoo, et al.
Published: (2025)
Beyond performance-wise Contribution Evaluation in Federated Learning
by: Pejo, Balazs
Published: (2026)
by: Pejo, Balazs
Published: (2026)
On the Sample Complexity of Two-Layer Networks: Lipschitz vs. Element-Wise Lipschitz Activation
by: Daniely, Amit, et al.
Published: (2022)
by: Daniely, Amit, et al.
Published: (2022)
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
by: Mai, Ngoc Hoang Anh, et al.
Published: (2022)
by: Mai, Ngoc Hoang Anh, et al.
Published: (2022)
Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?
by: Jiang, Liwei, et al.
Published: (2026)
by: Jiang, Liwei, et al.
Published: (2026)
Near-optimal Per-Action Regret Bounds for Sleeping Bandits
by: Nguyen, Quan, et al.
Published: (2024)
by: Nguyen, Quan, et al.
Published: (2024)
Non-Stationary Lipschitz Bandits
by: Nguyen, Nicolas, et al.
Published: (2025)
by: Nguyen, Nicolas, et al.
Published: (2025)
Multi-Agent Lipschitz Bandits
by: Chakraborty, Sourav, et al.
Published: (2026)
by: Chakraborty, Sourav, et al.
Published: (2026)
Lipschitz bounds for integral kernels
by: Reverdi, Justin, et al.
Published: (2026)
by: Reverdi, Justin, et al.
Published: (2026)
Scalable Lipschitz Estimation for CNNs
by: Sulehman, Yusuf, et al.
Published: (2024)
by: Sulehman, Yusuf, et al.
Published: (2024)
Bandits attack function optimization
by: Preux, Philippe, et al.
Published: (2026)
by: Preux, Philippe, et al.
Published: (2026)
Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth
by: Pătraşcu, Andrei, et al.
Published: (2021)
by: Pătraşcu, Andrei, et al.
Published: (2021)
Lipschitz constant estimation for general neural network architectures using control tools
by: Pauli, Patricia, et al.
Published: (2024)
by: Pauli, Patricia, et al.
Published: (2024)
Distribution estimation via Flow Matching with Lipschitz guarantees
by: Kunkel, Lea
Published: (2025)
by: Kunkel, Lea
Published: (2025)
Incentivized Lipschitz Bandits
by: Chakraborty, Sourav, et al.
Published: (2025)
by: Chakraborty, Sourav, et al.
Published: (2025)
Non-convex entropic mean-field optimization via Best Response flow
by: Lascu, Razvan-Andrei, et al.
Published: (2025)
by: Lascu, Razvan-Andrei, et al.
Published: (2025)
Training Transformers with Enforced Lipschitz Constants
by: Newhouse, Laker, et al.
Published: (2025)
by: Newhouse, Laker, et al.
Published: (2025)
Lipschitz Bandits with Stochastic Delayed Feedback
by: Liu, Zhongxuan, et al.
Published: (2025)
by: Liu, Zhongxuan, et al.
Published: (2025)
Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)
by: Potfer, Marius, et al.
Published: (2026)
Bi-Lipschitz Autoencoder With Injectivity Guarantee
by: Zhan, Qipeng, et al.
Published: (2026)
by: Zhan, Qipeng, et al.
Published: (2026)
Corruption-Robust Lipschitz Contextual Search
by: Zuo, Shiliang
Published: (2023)
by: Zuo, Shiliang
Published: (2023)
Approximation Theory for Lipschitz Continuous Transformers
by: Furuya, Takashi, et al.
Published: (2026)
by: Furuya, Takashi, et al.
Published: (2026)
Similar Items
-
Near-optimal estimates for the $\ell^p$-Lipschitz constants of deep random ReLU neural networks
by: Dirksen, Sjoerd, et al.
Published: (2025) -
Holographic functions and neural networks
by: Szegedy, Balazs
Published: (2026) -
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023) -
Near-optimal algorithms for private estimation and sequential testing of collision probability
by: Busa-Fekete, Robert, et al.
Published: (2025) -
Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)