This paper develops a framework for conformal prediction in dyadic regression problems under complex missingness mechanisms.

This paper presents a method for identifying probabilistic structures from empirical probability tensors using algebraic statistics and Kronecker-stack class of configuration matrices.

This paper presents a polynomial-time Monte Carlo algorithm to determine the symmetry Lie algebra of a parametrized variety directly from the parametrization.

This paper studies the existence of polynomial measures of dependence between two random variables that satisfy the data processing inequality and vanish on independence. It proves that no such polyno…

This paper proves conditions for efficiently approximating expectations of certain functions with respect to standard Gaussian or symmetric exponential probability measures.

The paper explains a method for finding the number of solutions to a system of multivariate polynomial inequalities over a finite field and applies it to find formulas for the number of contiguous sup…

This paper presents conditions for achieving optimal uniformity in Quasi-Monte Carlo estimators using Sobol' sequences and Artin-Schreier polynomials.

This paper presents a method to decompose the dynamics of Boolean networks into modules using an algebraic framework.

The polynomial-time low-degree conjecture, which predicts that low-degree indistinguishability, a uniform null distribution, permutation invariance, and independent resampling imply polynomial-time ha…

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

This paper derives deterministic equivalents for the prediction risk of over-parameterized linear regression with degenerate covariance matrices and dependent covariates, and identifies the configurat…

This paper proposes statistical procedures to identify coordinates responsible for change-points in multivariate time series data.

The paper formalizes Razborov's flag algebra method for finite simple graphs and creates a compiler to transform certificate data into algebraic proofs checked by Lean.

The paper presents black box algorithms for constructing standard generators and performing membership testing in Suzuki groups, with no false positives.

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

The paper analyzes low-degree estimation thresholds for recovering hidden signals in planted hypergraphs and tensor PCA, establishing sharp phase transitions and providing polynomial-time recovery alg…