Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

0111 · Oct 202019922001200920172026
11 results for covariance-adaptive

Optimistic covariance-adaptive algorithms improve combinatorial semi-bandits regret.

problem Optimal regret in stochastic combinatorial semi-bandits with adaptive covariance estimation.
method Design of OLS-UCB-C and COS-V algorithms leveraging online covariance estimation.
result Improved gap-free regret with T^1/2 complexity for COS-V.

The paper proposes a method to estimate treatment effects using CAR designs with additional covariates.

problem Estimating distributional treatment effects in CAR designs with additional covariates.
method Flexible distribution regression framework that incorporates additional covariates using machine learning methods.
result The proposed estimator attains the semiparametric efficiency bound for distributional treatment effects under CAR.

Method optimizes diffusion model generation to meet user preferences.

problem Optimizing diffusion model generation with only black-box target scores.
method Covariance-adaptive sequential optimization algorithm for black-box optimization.
result Proves superior performance in achieving better target scores.

New algorithm reduces semi-bandit regret using covariance estimates.

problem Complexity of semi-bandits due to joint distribution of outcomes.
method Develops a new sub-exponential distribution family and an algorithm using covariance estimates.
result Proves a new lower bound on expected regret and constructs an algorithm with asymptotic analysis.

Estimates treatment effects in randomized experiments with non-compliance.

problem Estimating distributional treatment effects in experiments with imperfect compliance.
method Proposes a regression-adjusted estimator based on distribution regression with Neyman-orthogonal moment conditions.
result Achieves semiparametric efficiency bound and demonstrates favorable performance in simulations and real data.

New method efficiently learns positive-definite curvature for neural nets.

problem Efficiently learn positive-definite curvature for neural net training.
method Spectral-factorized positive-definite curvature learning approach.
result Efficiently applies arbitrary matrix roots and generic curvature learning.

Oracle-efficient algorithms reduce combinatorial semi-bandit regret to logarithmic time.

problem Scalability issue in combinatorial semi-bandit problems due to high combinatorial optimization costs.
method Oracle-efficient frameworks that minimize oracle queries while maintaining tight regret guarantees.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) regret with O(loglogT)O(\log\log T) oracle queries for worst-case linear rewards.