English
Related papers

Related papers: Supercritical Space-Width Trade-offs for Resolutio…

200 papers

The purpose of this work is to investigate root finding problems defined on (quasi-)metric spaces, and ranging in Euclidean spaces. The motivation for this line of inquiry stems from recent models in biology and phylogenetics, where…

Optimization and Control · Mathematics 2025-10-28 Titus Pinta

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

Computational Complexity · Computer Science 2019-02-21 Albert Atserias , Tuomas Hakoniemi

The use of counterfactual explanations (CFXs) is an increasingly popular explanation strategy for machine learning models. However, recent studies have shown that these explanations may not be robust to changes in the underlying model…

Machine Learning · Computer Science 2022-12-21 Junqi Jiang , Francesco Leofante , Antonio Rago , Francesca Toni

Over the past few years, several adversarial training methods have been proposed to improve the robustness of machine learning models against adversarial perturbations in the input. Despite remarkable progress in this regard, adversarial…

Machine Learning · Computer Science 2022-04-04 Adel Javanmard , Mohammad Mehrabi

We clarify a number of issues that arise when extending the analysis of Strong Cosmic Censorship (SCC) to perturbations of highly charged Reissner-Nordstr\"{o}m de Sitter (RNdS) spacetimes. The linear stability of the Cauchy horizon can be…

General Relativity and Quantum Cosmology · Physics 2021-05-21 Raimon Luna , Miguel Zilhão , Vitor Cardoso , João L. Costa , José Natário

We consider the use of the well-known dual capacity bounding technique for deriving upper bounds on the capacity of indecomposable finite-state channels (FSCs) with finite input and output alphabets. In this technique, capacity upper bounds…

Information Theory · Computer Science 2021-07-13 Bashar Huleihel , Oron Sabag , Haim H. Permuter , Navin Kashyap , Shlomo Shamai

We develop a new method suitable for establishing lower bounds on the ball measure of noncompactness of operators acting between considerably general quasinormed function spaces. This new method removes some of the restrictions…

Functional Analysis · Mathematics 2024-11-19 Jan Lang , Zdeněk Mihula , Luboš Pick

In this work, a pre-Gr\"{u}ss inequality for positive Hilbert space operators is proved. So that, some numerical radius inequalities are proved. On the other hand, based on a non-commutative Binomial formula, a non-commutative upper bound…

Functional Analysis · Mathematics 2018-11-21 Mohammad W. Alomari

The popularity of deep learning methods in the time series domain boosts interest in interpretability studies, including counterfactual (CF) methods. CF methods identify minimal changes in instances to alter the model predictions. Despite…

Machine Learning · Computer Science 2024-10-11 Ziwen Kan , Shahbaz Rezaei , Xin Liu

We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…

Computational Complexity · Computer Science 2020-01-08 Susanna F. de Rezende , Or Meir , Jakob Nordström , Toniann Pitassi , Robert Robere , Marc Vinyals

We investigate the supersymmetric versions of Bondi-Metzner-Sachs or, equivalently, conformal Carroll symmetry in boundary dimensions $d>3$, with applications of flat space holography in mind. We identify the contraction of the relativistic…

High Energy Physics - Theory · Physics 2022-05-25 Arjun Bagchi , Daniel Grumiller , Poulami Nandi

Counterfactual explanations can be obtained by identifying the smallest change made to a feature vector to qualitatively influence a prediction; for example, from 'loan rejected' to 'awarded' or from 'high risk of cardiovascular disease' to…

Machine Learning · Computer Science 2020-05-05 Martin Pawelczyk , Johannes Haug , Klaus Broelemann , Gjergji Kasneci

We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…

Information Theory · Computer Science 2018-08-28 Chao Tian

We establish upper bounds for the distance to finite-dimensional subspaces in inner product spaces and improve some generalisations of Bessel's inequality obtained by Boas, Bellman and Bombieri. Refinements of the Hadamard inequality for…

Metric Geometry · Mathematics 2009-09-29 Sever Silvestru Dragomir

Decision \textsc{dnnf} (a.k.a. $\wedge_d$-\textsc{fbdd}) is an important special case of Decomposable Negation Normal Form (\textsc{dnnf}), a landmark knowledge compilation model. Like other known \textsc{dnnf} restrictions, Decision…

Computational Complexity · Computer Science 2026-03-06 Andrea Calí , Igor Razgon

We establish both sufficient and necessary conditions for weighted Hardy inequalities in metric spaces in terms of Assouad (co)dimensions. Our sufficient conditions in the case where the complement is thin are new even in Euclidean spaces,…

Functional Analysis · Mathematics 2017-04-14 Juha Lehrbäck

Structural models that admit multiple reduced forms, such as game-theoretic models with multiple equilibria, pose challenges in practice, especially when parameters are set-identified and the identified set is large. In such cases,…

Econometrics · Economics 2021-01-29 Nathan Canen , Kyungchul Song

For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…

Metric Geometry · Mathematics 2024-01-29 René Brandenberg , Katherina von Dichter , Bernardo González Merino

Although promising, existing defenses against query-based attacks share a common limitation: they offer increased robustness against attacks at the price of a considerable accuracy drop on clean samples. In this work, we show how to…

Computer Vision and Pattern Recognition · Computer Science 2024-10-24 Pascal Zimmer , Sébastien Andreina , Giorgia Azzurra Marson , Ghassan Karame

We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…

Functional Analysis · Mathematics 2024-07-19 Aris Daniilidis , Carlo de Bernardi , Enrico Miglierina