English
Related papers

Related papers: Hyperstable Sets with Voting and Algorithmic Hardn…

200 papers

We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…

Combinatorics · Mathematics 2024-02-23 Ilay Hoshen , Wojciech Samotij , Maksim Zhukovskii

Searches for continuous gravitational waves target nearly monochromatic gravitational wave emission from e.g. non-axysmmetric fast-spinning neutron stars. Broad surveys often require to explicitly search for a very large number of different…

General Relativity and Quantum Cosmology · Physics 2022-12-14 Benjamin Steltner , Thorben Menne , Maria Alessandra Papa , Heinz-Bernd Eggenstein

We discuss an "operational" approach to testing convex composite hypotheses when the underlying distributions are heavy-tailed. It relies upon Euclidean separation of convex sets and can be seen as an extension of the approach to testing by…

Statistics Theory · Mathematics 2018-11-13 Vincent Guigues , Anatoli Juditsky , Arkadi Nemirovski

Given a finite set of red and blue points in $\Rspace^d$, the MST-ratio is defined as the total length of the Euclidean minimum spanning trees of the red points and the blue points, divided by the length of the Euclidean minimum spanning…

Computational Geometry · Computer Science 2025-02-25 Afrouz Jabal Ameli , Faezeh Motiei , Morteza Saghafian

We study the robustness of the GHZ (or ``cat'') class of multi-partite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the…

Quantum Physics · Physics 2007-05-23 Somshubhro Bandyopadhyay , Daniel A. Lidar

We investigate the Euclidean $d$-Dimensional Stable Roommates problem, which asks whether a given set~$V$ of $d \cdot n$ points from the 2-dimensional Euclidean space can be partitioned into $n$ disjoint (unordered) subsets…

Computer Science and Game Theory · Computer Science 2022-07-05 Jiehua Chen , Sanjukta Roy

We consider the model introduced by Bilu and Linial (2010), who study problems for which the optimal clustering does not change when distances are perturbed. They show that even when a problem is NP-hard, it is sometimes possible to obtain…

Machine Learning · Computer Science 2014-09-01 Shalev Ben-David , Lev Reyzin

There is a common theme to some research questions in additive combinatorics and noise stability. Both study the following basic question: Let $\mathcal{P}$ be a probability distribution over a space $\Omega^\ell$ with all $\ell$ marginals…

Discrete Mathematics · Computer Science 2018-12-27 Jan Hązła , Thomas Holenstein , Elchanan Mossel

The stability of a system of $N$ equal sized mutually gravitating spheres resting on each other in a straight line and rotating in inertial space is considered. This is a generalization of the "Euler Resting" configurations previously…

Earth and Planetary Astrophysics · Physics 2018-02-06 D. J. Scheeres

In this paper, we aim to develop stochastic hard thresholding algorithms for the important problem of AUC maximization in imbalanced classification. The main challenge is the pairwise loss involved in AUC maximization. We overcome this…

Machine Learning · Computer Science 2020-11-05 Zhenhuan Yang , Baojian Zhou , Yunwen Lei , Yiming Ying

Methods to certify the robustness of neural networks in the presence of input uncertainty are vital in safety-critical settings. Most certification methods in the literature are designed for adversarial input uncertainty, but researchers…

Machine Learning · Computer Science 2023-01-26 Brendon G. Anderson , Somayeh Sojoudi

In this paper we first make and discuss a conjecture concerning Newtonian potentials in Euclidean n space which have all their mass on the unit sphere about the origin, and are normalized to be one at the origin. The conjecture essentially…

Classical Analysis and ODEs · Mathematics 2024-11-05 John Lewis

Quantum memory systems are vital in quantum information processing for dependable storage and retrieval of quantum states. Inspired by classical reliability theories that synthesize reliable computing systems from unreliable components, we…

Quantum Physics · Physics 2025-12-10 Anuj K. Nayak , Eric Chitambar , Lav R. Varshney

Environmental noise can hinder the metrological capabilities of entangled states. While the use of entanglement allows for Heisenberg-limited resolution, the largest permitted by quantum mechanics, deviations from strictly unitary dynamics…

Quantum Physics · Physics 2014-07-30 Jan Jeske , Jared H. Cole , Susana Huelga

We develop a probabilistic method for assessing the tail behavior and geometric stability of one-dimensional n i.i.d. samples by tracking how their span contracts when the most extreme points are trimmed. Central to our approach is the…

Machine Learning · Statistics 2025-09-03 Erwan Dereure , Emmanuel Akame Mfoumou , David Holcman

The highest current estimates for the amount of noise a quantum computer can tolerate are based on fault-tolerance schemes relying heavily on postselecting on no detected errors. However, there has been no proof that these schemes give even…

Quantum Physics · Physics 2012-06-22 Ben W. Reichardt

High-quality control is a fundamental requirement for quantum computation, but practically it is often hampered by the presence of various types of noises, which can be static or time-dependent. In many realistic scenarios, multiple noise…

Quantum Physics · Physics 2024-03-04 Bowen Shao , Xiaodong Yang , Ran Liu , Yue Zhai , Dawei Lu , Tao Xin , Jun Li

We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…

Computer Science and Game Theory · Computer Science 2017-01-30 Haris Aziz , Edith Elkind , Piotr Faliszewski , Martin Lackner , Piotr Skowron

Quadratically-constrained basis pursuit has become a popular device in sparse regularization; in particular, in the context of compressed sensing. However, the majority of theoretical error estimates for this regularizer assume an a priori…

Information Theory · Computer Science 2017-11-23 Simone Brugiapaglia , Ben Adcock

The linear functional strategy for the regularization of inverse problems is considered. For selecting the regularization parameter therein, we propose the heuristic quasi-optimality principle and some modifications including the smoothness…

Numerical Analysis · Mathematics 2018-05-23 Stefan Kindermann , Sergiy Pereverzyev , Andrey Pilipenko
‹ Prev 1 8 9 10 Next ›