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,657 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “BGLMs”

Combinatorial Causal Bandits without Graph Skeletoncs.LG

New algorithm reduces regret in combinatorial causal bandits without graph structure.

problem Minimizing regret in combinatorial causal bandits without graph structure.

method Design of algorithms for binary general causal models and BGLMs without graph skeleton.

result Achieves

O(\sqrt{T}\ln T)

expected regret for causal models and

O(T^{\frac{2}{3}}\ln T)

for BGLMs.

combinatorial causal bandits regret minimization binary general causal models BGLMs graph structure

2023-01-31abs ↗pdf ↗

Combinatorial Causal Banditscs.LG

Algorithm BGLM-OFU minimizes regret in combinatorial causal bandits with binary models.

problem Minimizing expected regret in combinatorial causal bandits with binary generalized linear models.

method BGLM-OFU algorithm based on maximum likelihood estimation for Markovian BGLMs, and causal inference techniques for linear models with hidden variables.

result Achieves

O(\sqrt{T}\log T)

regret for binary generalized linear models.

combinatorial causal bandits binary generalized linear models maximum likelihood estimation regret analysis causal inference

2022-06-04abs ↗pdf ↗