:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Binshuai, Di, Qiwei, Yin, Ming, Wang, Mengdi, Gu, Quanquan, Wei, Peng
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	https://arxiv.org/abs/2409.02416
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Relative Wasserstein Angle and the Problem of the $W_2$-Nearest Gaussian Distribution
par: Wang, Binshuai, et autres
Publié: (2026)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
par: Di, Qiwei, et autres
Publié: (2024)

Unified Convergence Analysis for Score-Based Diffusion Models with Deterministic Samplers
par: Li, Runjia, et autres
Publié: (2024)

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
par: Di, Qiwei, et autres
Publié: (2024)

On the Limits of Test-Time Compute: Sequential Reward Filtering for Better Inference
par: Yu, Yue, et autres
Publié: (2025)

Pessimistic Nonlinear Least-Squares Value Iteration for Offline Reinforcement Learning
par: Di, Qiwei, et autres
Publié: (2023)

Dimension-Independent Convergence of Underdamped Langevin Monte Carlo in KL Divergence
par: Zhang, Shiyuan, et autres
Publié: (2026)

Best-of-Majority: Minimax-Optimal Strategy for Pass@$k$ Inference Scaling
par: Di, Qiwei, et autres
Publié: (2025)

Higher-order Linear Attention
par: Zhang, Yifan, et autres
Publié: (2025)

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
par: Ji, Kaixuan, et autres
Publié: (2026)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
par: Ji, Kaixuan, et autres
Publié: (2026)

Deep Delta Learning
par: Zhang, Yifan, et autres
Publié: (2026)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
par: Di, Qiwei, et autres
Publié: (2023)

Fast Gradient Computation for Gromov-Wasserstein Distance
par: Zhang, Wei, et autres
Publié: (2024)

On the Statistical Complexity for Offline and Low-Adaptive Reinforcement Learning with Structures
par: Yin, Ming, et autres
Publié: (2025)

Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distances
par: Nguyen, Khai, et autres
Publié: (2025)

Two-sample Test using Projected Wasserstein Distance
par: Wang, Jie, et autres
Publié: (2020)

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
par: Li, Xuheng, et autres
Publié: (2025)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
par: He, Jiafan, et autres
Publié: (2025)

Understanding SGD with Exponential Moving Average: A Case Study in Linear Regression
par: Li, Xuheng, et autres
Publié: (2025)

Private Wasserstein Distance
par: Li, Wenqian, et autres
Publié: (2024)

The Observable Wasserstein Distance
par: Santos, Edivaldo Lopes dos, et autres
Publié: (2026)

Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning
par: Xu, Ao, et autres
Publié: (2026)

Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes
par: Ye, Chenlu, et autres
Publié: (2022)

Causal Attention with Lookahead Keys
par: Song, Zhuoqing, et autres
Publié: (2025)

Distance-Based Tree-Sliced Wasserstein Distance
par: Tran, Hoang V., et autres
Publié: (2025)

A Theoretical Perspective for Speculative Decoding Algorithm
par: Yin, Ming, et autres
Publié: (2024)

Feature Selection Based on Wasserstein Distance
par: Li, Fuwei
Publié: (2024)

Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis
par: Zhang, Zikun, et autres
Publié: (2024)

Energy-Weighted Flow Matching for Offline Reinforcement Learning
par: Zhang, Shiyuan, et autres
Publié: (2025)

The Z-Gromov-Wasserstein Distance
par: Bauer, Martin, et autres
Publié: (2024)

Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances
par: Wang, Jie, et autres
Publié: (2024)

Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distances
par: Wang, Lei, et autres
Publié: (2025)

Sliced-Wasserstein Distance-based Data Selection
par: Pallage, Julien, et autres
Publié: (2025)

Pure Exploration in Asynchronous Federated Bandits
par: Wang, Zichen, et autres
Publié: (2023)

Validating Climate Models with Spherical Convolutional Wasserstein Distance
par: Garrett, Robert C., et autres
Publié: (2024)

A Relaxed Wasserstein Distance Formulation for Mixtures of Radially Contoured Distributions
par: Chen, Keyu, et autres
Publié: (2025)

Wasserstein Distances, Neuronal Entanglement, and Sparsity
par: Sawmya, Shashata, et autres
Publié: (2024)

Spherical Tree-Sliced Wasserstein Distance
par: Tran, Viet-Hoang, et autres
Publié: (2025)

Robust Estimation under the Wasserstein Distance
par: Nietert, Sloan, et autres
Publié: (2023)