most citedA Computationally Efficient Sparsified Online Newton Method

1 citations · 1 across the 4 of their papers we have counts for

collaborators

7 papers

cs.AI2026

Cogentic: Multi-Agent Orchestration for Automated Proof Discovery

Yang Cai, Vineet Gupta, Yanchen Jiang +4

We present Cogentic, a multi-agent harness for automated proof discovery on open research problems. While frontier language models can generate strong mathematical ideas in a singl…

cs.GT2026

Efficiency of Generalized Proportional First-Price Auctions Under Auto-bidding

Yang Cai, Vineet Gupta, Yanchen Jiang +4

Auto-bidding is now widely adopted in online advertising platforms, allowing advertisers to specify high-level campaign objectives--such as maximizing total value subject to a retu…

cs.GT2026

The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Markets

Yang Cai, Vineet Gupta, Yanchen Jiang +5

We study Bulow-Klemperer-style competition complexity in two-sided double auctions with unit-demand buyers drawn i.i.d. from and unit-supply sellers drawn i.i.d. from…

stat.ML2026

Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant

Yang Cai, Vineet Gupta, Yanchen Jiang +4

Prediction with expert advice is a fundamental problem in online learning. When the time horizon is known in advance, the minimax cumulative regret over experts is asymptot…

cs.LG2026

Efficient Online Inverse Optimization with Regret

Yang Cai, Anupam Gupta, Vineet Gupta +7

We give a deterministic algorithm for online inverse linear optimization with regret , uniform in the horizon and time per round. A bound of this order was obtaine…

cs.LG2026

A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using AI-Guided Evolutionary Search

Yang Cai, Vineet Gupta, Zun Li +1

The celebrated Myerson--Satterthwaite theorem shows that in bilateral trade, no mechanism can be simultaneously fully efficient, Bayesian incentive compatible (BIC), and budget bal…

cs.LG2023★ 1 cited

A Computationally Efficient Sparsified Online Newton Method

Fnu Devvrit, Sai Surya Duvvuri, Rohan Anil +3

Second-order methods hold significant promise for enhancing the convergence of deep neural network training; however, their large memory and computational demands have limited thei…