Dmitriy Kunisky

Available identifiers

zbMath Open kunisky.dmitriyMaRDI QIDQ2098295

List of research outcomes

Publication	Date of Publication	Type
Fitting an ellipsoid to random points: predictions using the replica method	2025-01-23	Paper
On the concentration of Gaussian Cayley matrices	2025-01-06	Paper
Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation	2024-11-28	Paper
A degree 4 sum-of-squares lower bound for the clique number of the Paley graph	2024-11-19	Paper
Strong recovery of geometric planted matchings	2024-07-19	Paper
Subexponential-time algorithms for sparse PCA	2024-07-03	Paper
Linear Programming and Community Detection	2024-02-23	Paper
The Spectrum of the Grigoriev–Laurent Pseudomoments	2024-01-10	Paper
Fitting an ellipsoid to random points: predictions using the replica method	2023-10-02	Paper
Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation	2023-07-24	Paper
Online Algorithms and Lower Bounds for Average-Case Matrix Discrepancy	2023-07-19	Paper
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant	2023-05-31	Paper
Spectral pseudorandomness and the road to improved clique number bounds for Paley graphs	2023-03-29	Paper
https://portal.mardi4nfdi.de/entity/Q5875785	2023-02-03	Paper
Generic MANOVA limit theorems for products of projections	2023-01-23	Paper
Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio	2022-12-13	Paper
On the concentration of Gaussian Cayley matrices	2022-11-30	Paper
Dual bounds for the positive definite functions approach to mutually unbiased bases	2022-11-17	Paper
Dual bounds for the positive definite functions approach to mutually unbiased bases	2022-02-26	Paper
The Average-Case Time Complexity of Certifying the Restricted Isometry Property	2022-02-17	Paper
A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian	2021-10-20	Paper
Strong recovery of geometric planted matchings	2021-07-12	Paper
Hypothesis testing with low-degree polynomials in the Morris class of exponential families	2020-11-06	Paper
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs	2020-08-27	Paper
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio	2019-07-26	Paper
Computational Hardness of Certifying Bounds on Constrained PCA Problems	2019-02-19	Paper
Sum-of-Squares Optimization and the Sparsity Structure of Equiangular Tight Frames	2019-01-30	Paper
A Gramian Description of the Degree 4 Generalized Elliptope	2018-12-30	Paper
Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing	N/A	Paper
Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs	N/A	Paper
Tensor cumulants for statistical inference on invariant distributions	N/A	Paper

Research outcomes over time

This page was built for person: Dmitriy Kunisky