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 return-on-spend (ROS) constraint--rather than manual per-query bids. A central question in algorithmic mechanism design is characterizing the wo...
Yang Cai, Vineet Gupta, Yan-Chen Jiang et al.· 1 citation
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 single shot, single-shot generation is often insufficient for open problems that require exploring multiple competing conjectures, overcoming sub...
Yang Cai, Vineet Gupta, Yan-Chen Jiang et al.· 0 citations
An algorithm is given, requiring no knowledge of the horizon, whose cumulative regret satisfies R_t, whose cumulative regret satisfies 1 + O(\sqrt{\ln \ln n / \ln n})\bigr)\sqrt{t \ln n / 2}$ simultaneously for every $t \ge 1$.
Yang Cai, Vineet Gupta, Yan-Chen Jiang et al.· 2 citations
This work builds on the variable-metric framework of Sakaue et al., adding a self-normalized rank-one update, and replaces the $\log\det$ potential by the trace power $\tr(H^{-1/2})$, which is bounded outright and removes the $\ln T$.
Yang Cai, Anupam Gupta, Vineet Gupta et al.· 3 citations· ⚡1
H hierarchical comparability is identified as a sufficient structural condition on $\mathscr S$ under which the optimal complexity is nearly linear, $\widetilde \Theta(n/\epsilon^2)$, with pairwise query families as a canonical example.
Jon M. Kleinberg, Amin Saberi, Xi-Zhi Tan et al.· arXiv.org· 1 citation· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
