855 citations · 2.9k across the 86 of their papers we have counts for
98 papers
Beyond the Best: Estimating Distribution Functionals in Infinite-Armed Bandits
Yifei Wang, Tavor Baharav, Yanjun Han +2
In the infinite-armed bandit problem, each arm's average reward is sampled from an unknown distribution, and each arm can be sampled further to obtain noisy estimates of the averag…
Approximate Function Evaluation via Multi-Armed Bandits
Tavor Z. Baharav, Gary Cheng, Mert Pilanci +1
We study the problem of estimating the value of a known smooth function at an unknown point , where each component can be sampled via a noi…
Information Dispersal with Provable Retrievability for Rollups
Kamilla Nazirkhanova, Joachim Neu, David Tse
The ability to verifiably retrieve transaction or state data stored off-chain is crucial to blockchain scaling techniques such as rollups or sharding. We formalize the problem and…
Three Attacks on Proof-of-Stake Ethereum
Caspar Schwarz-Schilling, Joachim Neu, Barnabé Monnot +3
Recently, two attacks were presented against Proof-of-Stake (PoS) Ethereum: one where short-range reorganizations of the underlying consensus chain are used to increase individual…
Group-Structured Adversarial Training
Farzan Farnia, Amirali Aghazadeh, James Zou +1
Robust training methods against perturbations to the input data have received great attention in the machine learning literature. A standard approach in this direction is adversari…
TaiJi: Longest Chain Availability with BFT Fast Confirmation
Songze Li, David Tse
Most state machine replication protocols are either based on the 40-years-old Byzantine Fault Tolerance (BFT) theory or the more recent Nakamoto's longest chain design. Longest cha…