arXiv Machine Learning

An algebraic proof of Colombo's difference-power determinant conjecture

arXiv:2608. 28274v1 Announce Type: new Abstract: Let $n\ge2$ be even, let $\lambda=(\lambda_1,\ldots,\lambda_n)\in\mathbb{R}^n$ have pairwise distinct coordinates, and define the difference-power matrix \[ A_d(\lambda) := \bigl[(\lambda_r-\lambda_s)^d\bigr]_{r,s=1}^n, \qquad d\in\mathbb{N}.

arXiv AI
Jul 28

An Explicit Counterexample to Stanley's Rankwise Lower-Bound Conjecture for Differential Posets

arXiv:2607. 22988v1 Announce Type: cross Abstract: In Problem~6 of his 1988 paper on differential posets, Stanley asked for the least possible cardinality of a fixed rank of an $r$-differential poset and suggested that the minimum should be attained by $Y^r$, the $r$-fold Cartesian power of Young's lattice.

By Xinan Dai, Yuchen Yang, Wenhao Deng, Yingdong Shi, Tailin Wu
arXiv AI
Jun 12

Real-rootedness of the Poincar\'e polynomials of $\overline{\mathcal M}_{0,n}$: an AI-assisted proof

arXiv:2605. 29151v2 Announce Type: replace-cross Abstract: We prove real-rootedness for the Poincar\'e polynomial \[ P_n(t)=\sum_{i=0}^{n-3} \dim H^{2i}(\overline{\mathcal M}_{0,n};\mathbb{Q})t^i \] of the Deligne--Mumford moduli space $\overline{\mathcal M}_{0,n}$ of stable $n$-pointed rational curves, proving a conjecture of Aluffi--Chen--Marcolli.

By Gergely B\'erczi, Young-Hoon Kiem
arXiv Machine Learning
Sep 25

An Exposition of GPT Astra's Proof of Lower Bound on DP Continual Counting

The note provides a detailed proof of Astra’s lower bound for differentially private continual counting, building on recent work by Harrison and Leeman. It discusses earlier results, including a Ω(√{3}√{log(n)}) bound by Bairaktari and Larsen and their subsequent Ω(log^2(n)) bound for pure differential privacy. The authors aim to offer a more natural and accessible proof, hoping to aid further research in the area.

By Jalaj Upadhyay
arXiv Machine Learning
Jul 28

A Resolution of the SS--RS--GD Inequalities

arXiv:2607. 22620v1 Announce Type: cross Abstract: Yun, Sra, and Jadbabaie (COLT 2021, open question) conjectured the SS--RS--GD inequalities: for well-conditioned symmetric matrices $A_1,\dots,A_n$, the operators $W_{ss}$, $W_{rs}$, and $W_{gd}$ that encode the expected iterate of single-shuffle SGD, random-reshuffle SGD, and gradient descent on a quadratic finite sum should satisfy \[ \|W_{ss}\|\le \| W_{rs}\|\le \|W_{gd}\|.

By Binghui Peng