:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Gu, Yuzhou, Kuang, Nikki Lijing, Ma, Yi-An, Song, Zhao, Zhang, Lichen
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Machine Learning
Accesso online:	https://arxiv.org/abs/2410.05700
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
di: Gu, Yuzhou, et al.
Pubblicazione: (2023)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
di: Kook, Yunbum, et al.
Pubblicazione: (2023)

Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
di: Jiang, Minhui, et al.
Pubblicazione: (2024)

Sublinear Time Quantum Sensitivity Sampling
di: Song, Zhao, et al.
Pubblicazione: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
di: Mishra, Nina, et al.
Pubblicazione: (2025)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
di: Kook, Yunbum, et al.
Pubblicazione: (2024)

Robust learning of halfspaces under log-concave marginals
di: Lange, Jane, et al.
Pubblicazione: (2025)

Oracle-based Uniform Sampling from Convex Bodies
di: Dang, Thanh, et al.
Pubblicazione: (2025)

Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models
di: Zhou, Huanjian, et al.
Pubblicazione: (2024)

Sublinear Time Quantum Algorithm for Attention Approximation
di: Song, Zhao, et al.
Pubblicazione: (2026)

Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
di: Song, Zhao, et al.
Pubblicazione: (2025)

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
di: Song, Zhao, et al.
Pubblicazione: (2022)

On the query complexity of sampling from non-log-concave distributions
di: He, Yuchen, et al.
Pubblicazione: (2025)

Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
di: Mangoubi, Oren, et al.
Pubblicazione: (2024)

Complexity of Non-Log-Concave Sampling in Fisher Information
di: Chewi, Sinho, et al.
Pubblicazione: (2026)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
di: He, Yuchen, et al.
Pubblicazione: (2025)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
di: Oki, Taihei, et al.
Pubblicazione: (2026)

Learning and Testing Convex Functions
di: Pinto Jr., Renato Ferreira, et al.
Pubblicazione: (2025)

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
di: McWhorter, Atticus, et al.
Pubblicazione: (2025)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
di: Feng, Shiyuan, et al.
Pubblicazione: (2025)

On Differentially Private String Distances
di: Hu, Jerry Yao-Chieh, et al.
Pubblicazione: (2024)

A proximal gradient algorithm for composite log-concave sampling
di: Liu, Linghai, et al.
Pubblicazione: (2026)

Chasing Convex Functions with Long-term Constraints
di: Lechowicz, Adam, et al.
Pubblicazione: (2024)

$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
di: Lin, Honghao, et al.
Pubblicazione: (2025)

Near-optimal Swap Regret Minimization for Convex Losses
di: Hu, Lunjia, et al.
Pubblicazione: (2026)

The adaptive complexity of parallelized log-concave sampling
di: Zhou, Huanjian, et al.
Pubblicazione: (2024)

High-accuracy log-concave sampling with stochastic queries
di: Chen, Fan, et al.
Pubblicazione: (2026)

Log-Time K-Means Clustering for 1D Data: Novel Approaches with Proof and Implementation
di: Hyun, Jake
Pubblicazione: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
di: Cheng, Kangke, et al.
Pubblicazione: (2026)

Breaking the $T^{2/3}$ Barrier for Sequential Calibration
di: Dagan, Yuval, et al.
Pubblicazione: (2024)

Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2026)

A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
di: Wadia, Neha S.
Pubblicazione: (2024)

Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
di: Vaze, Rahul, et al.
Pubblicazione: (2024)

Sample-Adaptivity Tradeoff in On-Demand Sampling
di: Haghtalab, Nika, et al.
Pubblicazione: (2025)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
di: Zhou, Yingli, et al.
Pubblicazione: (2024)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
di: Alman, Josh, et al.
Pubblicazione: (2025)

Towards Optimal Robustness in Learning-Augmented Paging
di: Chen, Peng, et al.
Pubblicazione: (2026)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
di: Dhawan, Abhishek, et al.
Pubblicazione: (2024)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
di: Vaze, Rahul, et al.
Pubblicazione: (2025)