Introduces SpectralUCB and SpectralTS algorithms leveraging spectral features and effective dimension to efficiently learn smooth graph functions in large-scale bandit problems, achieving low regret.

Tomáš Kocák, Michal Valko, Rémi Munos et al.

URGE algorithm uses Girsanov estimation for unbiased resampling, enhancing diffusion model generation quality.

Chenyang Wang, Weizhong Wang, Yinuo Ren et al.

This paper derives a n^{-1/4} rate Gaussian approximation for entropy-regularized Q-learning with function approximation, using high-dimensional CLT techniques.

Artemy Rubtsov, Rahul Singh, Eric Moulines et al.

Implement conformal anomaly detection in Python using nonconform to provide statistically calibrated p-values.

Oliver Hennhöfer, Maximilian Kirsch, Christine Preisach

Proposed a model-based bootstrap method for finite controlled Markov chains, improving confidence interval coverage.

Ziwei Su, Imon Banerjee, Diego Klabjan

Introduced a sequential supersample framework using sequential CMI to control generalization gaps.

Futoshi Futami, Masahiro Fujisawa

Proposed ZoomSIB-UCB algorithm achieves optimal regret O(T^{2/3}) for single-index bandits.

Devdan Dey, Sujoy Bhore, Avishek Ghosh

CONTRA employs normalizing flows to produce multi-dimensional prediction regions with guaranteed coverage, outperforming geometric methods.

Zhenhan Fang, Aixin Tan, Jian Huang

MIRA scores condition distribution accuracy via sample regions, enabling scalable Bayesian model validation and comparison.

Sammy Sharief, Justine Zeghal, Gabriel Missael Barco et al.

A divergence-based method outperforms traditional weighting in small sample scenarios.

Olav Benjamin Vassend

Proposes Sliced-Regularized OT (SROT), leveraging smoothened SOT plans to improve OT approximation with a Sinkhorn-style algorithm.

Khai Nguyen

CLVAE model uses a variational autoencoder for long-term customer revenue forecasting, enhancing accuracy.

Jeffrey Näf, Riana Valera Mbelson, Markus Meierer

The Mixed Membership sub-Gaussian Model (MMSG) addresses the limitation of classical GMM by allowing observations to belong to multiple components.

Huan Qing

WassersteinGrad explains dynamic physical field predictions by computing the entropic Wasserstein barycenter, enhancing autoregressive weather forecasting model interpretability.

Younes Essafouri, Laure Raynaud, Luciano Drozda et al.

FedSPDnet outperforms traditional methods on EEG datasets using ProjAvg and RLAvg strategies, enhancing F1 score and robustness.

Thibault Pautrel, Florent Bouchard, Ammar Mian et al.

SQUEAK algorithm achieves low space complexity for kernel ridge regression using unnormalized ridge leverage scores.

Daniele Calandriello, Alessandro Lazaric, Michal Valko

Pliable Rejection Sampling (PRS) learns the proposal distribution using kernel estimation, ensuring high-probability i.i.d. sampling.

Akram Erraqabi, Michal Valko, Alexandra Carpentier et al.

Concave statistical utility maximization bandits using influence-function gradients.

Matías Carrasco, Alejandro Cholaquidis

Fast estimation of Gaussian mixture components via centering and singular value thresholding without iteration.

Huan Qing

Revisiting active sequential prediction-powered mean estimation reveals smallest confidence width when constant probability weight is near one.

Maria-Eleni Sfyraki, Jun-Kun Wang