Saved in:
| Main Author: | Candanedo, Julio |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.05901 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
by: Qin, Yilong, et al.
Published: (2023)
by: Qin, Yilong, et al.
Published: (2023)
In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
by: Kook, Yunbum, et al.
Published: (2024)
by: Kook, Yunbum, et al.
Published: (2024)
Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
by: Kook, Yunbum, et al.
Published: (2024)
by: Kook, Yunbum, et al.
Published: (2024)
Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
by: Gupta, Shivam, et al.
Published: (2024)
by: Gupta, Shivam, et al.
Published: (2024)
GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
by: Fahrbach, Matthew, et al.
Published: (2024)
by: Fahrbach, Matthew, et al.
Published: (2024)
Dynamic Consistent $k$-Center Clustering with Optimal Recourse
by: Forster, Sebastian, et al.
Published: (2024)
by: Forster, Sebastian, et al.
Published: (2024)
Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)
by: Black, Hadley, et al.
Published: (2024)
Fast Partition-Based Cross-Validation With Centering and Scaling for $\mathbf{X}^\mathbf{T}\mathbf{X}$ and $\mathbf{X}^\mathbf{T}\mathbf{Y}$
by: Engstrøm, Ole-Christian Galbo, et al.
Published: (2024)
by: Engstrøm, Ole-Christian Galbo, et al.
Published: (2024)
Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
by: Braverman, Vladimir, et al.
Published: (2024)
by: Braverman, Vladimir, et al.
Published: (2024)
Thompson Sampling Itself is Differentially Private
by: Ou, Tingting, et al.
Published: (2024)
by: Ou, Tingting, et al.
Published: (2024)
Improving Online Algorithms via ML Predictions
by: Kumar, Ravi, et al.
Published: (2024)
by: Kumar, Ravi, et al.
Published: (2024)
A Model for Combinatorial Dictionary Learning and Inference
by: Blum, Avrim, et al.
Published: (2024)
by: Blum, Avrim, et al.
Published: (2024)
Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
by: Shahout, Rana, et al.
Published: (2024)
by: Shahout, Rana, et al.
Published: (2024)
Active Learning with Simple Questions
by: Kontonis, Vasilis, et al.
Published: (2024)
by: Kontonis, Vasilis, et al.
Published: (2024)
Fast White-Box Adversarial Streaming Without a Random Oracle
by: Feng, Ying, et al.
Published: (2024)
by: Feng, Ying, et al.
Published: (2024)
Dynamic Correlation Clustering in Sublinear Update Time
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Linear Submodular Maximization with Bandit Feedback
by: Chen, Wenjing, et al.
Published: (2024)
by: Chen, Wenjing, et al.
Published: (2024)
Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
by: He, Yuchen, et al.
Published: (2024)
by: He, Yuchen, et al.
Published: (2024)
A Note On Deterministic Submodular Maximization With Bounded Curvature
by: Li, Wenxin
Published: (2024)
by: Li, Wenxin
Published: (2024)
Optimal bounds for $\ell_p$ sensitivity sampling via $\ell_2$ augmentation
by: Munteanu, Alexander, et al.
Published: (2024)
by: Munteanu, Alexander, et al.
Published: (2024)
Dynamic Spectral Clustering with Provable Approximation Guarantee
by: Laenen, Steinar, et al.
Published: (2024)
by: Laenen, Steinar, et al.
Published: (2024)
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
by: Nath, Ankur, et al.
Published: (2024)
by: Nath, Ankur, et al.
Published: (2024)
Online Weighted Paging with Unknown Weights
by: Levy, Orin, et al.
Published: (2024)
by: Levy, Orin, et al.
Published: (2024)
Accelerating Matroid Optimization through Fast Imprecise Oracles
by: Eberle, Franziska, et al.
Published: (2024)
by: Eberle, Franziska, et al.
Published: (2024)
Settling Time vs. Accuracy Tradeoffs for Clustering Big Data
by: Draganov, Andrew, et al.
Published: (2024)
by: Draganov, Andrew, et al.
Published: (2024)
Sharper Bounds for Chebyshev Moment Matching, with Applications
by: Musco, Cameron, et al.
Published: (2024)
by: Musco, Cameron, et al.
Published: (2024)
Testing Support Size More Efficiently Than Learning Histograms
by: Pinto Jr., Renato Ferreira, et al.
Published: (2024)
by: Pinto Jr., Renato Ferreira, et al.
Published: (2024)
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
by: Agarwal, Arpit, et al.
Published: (2024)
by: Agarwal, Arpit, et al.
Published: (2024)
Energy-Efficient Scheduling with Predictions
by: Balkanski, Eric, et al.
Published: (2024)
by: Balkanski, Eric, et al.
Published: (2024)
GEFL: Extended Filtration Learning for Graph Classification
by: Zhang, Simon, et al.
Published: (2024)
by: Zhang, Simon, et al.
Published: (2024)
Online Classification with Predictions
by: Raman, Vinod, et al.
Published: (2024)
by: Raman, Vinod, et al.
Published: (2024)
Stochastic Bandits with ReLU Neural Networks
by: Xu, Kan, et al.
Published: (2024)
by: Xu, Kan, et al.
Published: (2024)
Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate
by: Shen, Jie
Published: (2024)
by: Shen, Jie
Published: (2024)
Improving LSH via Tensorized Random Projection
by: Verma, Bhisham Dev, et al.
Published: (2024)
by: Verma, Bhisham Dev, et al.
Published: (2024)
Truthfulness of Calibration Measures
by: Haghtalab, Nika, et al.
Published: (2024)
by: Haghtalab, Nika, et al.
Published: (2024)
On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)
by: Song, Zhao, et al.
Published: (2024)
The Cost of Consistency: Submodular Maximization with Constant Recourse
by: Dütting, Paul, et al.
Published: (2024)
by: Dütting, Paul, et al.
Published: (2024)
Unrolled denoising networks provably learn optimal Bayesian inference
by: Karan, Aayush, et al.
Published: (2024)
by: Karan, Aayush, et al.
Published: (2024)
$k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers
by: Haris, Themistoklis
Published: (2024)
by: Haris, Themistoklis
Published: (2024)
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
by: Oki, Taihei, et al.
Published: (2024)
by: Oki, Taihei, et al.
Published: (2024)
Similar Items
-
Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
by: Qin, Yilong, et al.
Published: (2023) -
In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
by: Kook, Yunbum, et al.
Published: (2024) -
Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
by: Kook, Yunbum, et al.
Published: (2024) -
Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
by: Gupta, Shivam, et al.
Published: (2024) -
GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
by: Fahrbach, Matthew, et al.
Published: (2024)