activity
20192026
most citedReplicable Clustering

2 citations · 8 across the 30 of their papers we have counts for

collaborators
Showing 2026Show all

15 papers · 1 filter

cs.LG2026

Query Feedback and Teaching for Stable and Certifiable Language Generation

Farnam Mansouri, Alireza F. Pour, Grigoris Velegkas +1

Language generation in the limit studies whether a learner observing an enumeration of an unknown target language can eventually generate only valid, previously unseen elements. We…

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

Improved Revenue Guarantees for Selling Separately and Bundling

Yang Cai, Vineet Gupta, Yanchen Jiang +4

We study how much revenue a seller can lose by restricting attention to selling separately or grand bundling, in the setting of a single additive buyer with independent item values…

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.GT2026

Forging Self-Funded Marketplaces among Strategic Agents

Yuan Deng, Vasilis Gkatzelis, Xizhi Tan +2

We introduce the problem of designing mechanisms that incentivize strategic agents to form self-funded marketplaces. In our model, if agent exerts effort , they i…

cs.GT2026

From Compensation Design to Budget-Feasible Mechanisms: A Constant Approximation for Subadditive Valuations

Ioannis Anagnostides, Kshipra Bhawalkar, Christopher Liaw +3

Budget-feasible mechanism design is a classic framework introduced by Singer, but there is still a wide gap between existing upper and lower bounds. In this paper, we significantly…

cs.DS2026

Learning Distributions from Multiple Data Providers

Jon Kleinberg, Amin Saberi, Xizhi Tan +1

Motivated by learning from heterogeneous and overlapping data providers, we study a stylized model of distribution learning from restricted conditional samples. The goal is to lear…

cs.GT2026

Compensation Design

Ioannis Anagnostides, Kshipra Bhawalkar, Christopher Liaw +5

We introduce compensation design, the problem of designing payment rules that incentivize high-quality contributions in decentralized environments. Here, a budget-constrained princ…

cs.DS2026

On Language Generation in the Limit with Bounded Memory

Jon Kleinberg, Anay Mehrotra, Amin Saberi +1

We study language generation in the limit under bounded memory. In this task, a learner observes examples from an unknown target language one at a time and must eventually output o…

stat.ML2026

What is Learnable in Valiant's Theory of the Learnable?

Steve Hanneke, Anay Mehrotra, Grigoris Velegkas +1

Valiant's 1984 paper is widely credited with introducing the PAC learning model, but it, in fact, introduced a different model: unlike PAC learning, the learner receives only posit…

cs.LG2026

On the Learning Curves of Revenue Maximization

Steve Hanneke, Alkis Kalavasis, Shay Moran +1

Learning curves are a fundamental primitive in supervised learning, describing how an algorithm's performance improves with more data and providing a quantitative measure of its ge…

stat.ML2026

Differentially Private Language Generation and Identification in the Limit

Anay Mehrotra, Grigoris Velegkas, Xifan Yu +1

We initiate the study of language generation in the limit, a model recently introduced by Kleinberg and Mullainathan [KM24], under the constraint of differential privacy. We consid…