English
Related papers

Related papers: Hardness measures and resolution lower bounds

200 papers

Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combinatorial discrepancy. Depending on the ranges, several…

Computational Geometry · Computer Science 2011-03-24 Panos Giannopoulos , Christian Knauer , Magnus Wahlström , Daniel Werner

This paper considers the problem of specifying a simple approximating density function for a given data set (x_1,...,x_n). Simplicity is measured by the number of modes but several different definitions of approximation are introduced. The…

Statistics Theory · Mathematics 2007-06-13 P. Laurie Davies , Arne Kovac

Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to constrained-random verification. While the theory of these…

Artificial Intelligence · Computer Science 2015-12-22 Kuldeep S. Meel , Moshe Vardi , Supratik Chakraborty , Daniel J. Fremont , Sanjit A. Seshia , Dror Fried , Alexander Ivrii , Sharad Malik

We study finitely additive extensions of the asymptotic density to all the subsets of natural numbers. Such measures are called density measures. We consider a class of density measures constructed from free ultrafilters on $\mathbb{N}$ and…

Number Theory · Mathematics 2016-01-26 Ryoichi Kunisada

There is a basic paradigm, called here the radius of well-posedness, which quantifies the "distance" from a given well-posed problem to the set of ill-posed problems of the same kind. In variational analysis, well-posedness is often…

Optimization and Control · Mathematics 2022-06-17 Asen L. Dontchev , Helmut Gfrerer , Alexander Y. Kruger , Jiří V. Outrata

Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental problems in knowledge representation and reasoning are located at…

Computational Complexity · Computer Science 2016-07-04 Ronald de Haan , Stefan Szeider

Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying an input formula. In…

Logic in Computer Science · Computer Science 2020-03-10 Roberto Sebastiani

The problem of testing hypothesis that a density function has no more than $\mu$ derivatives versus it has more than $\mu$ derivatives is considered. For a solution, the $L^2$ norms of wavelet orthogonal projections on some orthogonal…

Statistics Theory · Mathematics 2018-09-11 Bogdan Ćmiel , Karol Dziedziul , Barbara Wolnik

Heteroscedasticity is common in real world applications and is often handled by incorporating case weights into a modeling procedure. Intuitively, models fitted with different weight schemes would have a different level of complexity…

Statistics Theory · Mathematics 2022-04-15 Bo Luan , Yoonkyung Lee , Yunzhang Zhu

Industrial SAT formula generation is a critical yet challenging task. Existing SAT generation approaches can hardly simultaneously capture the global structural properties and maintain plausible computational hardness. We first present an…

Artificial Intelligence · Computer Science 2024-02-09 Yang Li , Xinyan Chen , Wenxuan Guo , Xijun Li , Wanqian Luo , Junhua Huang , Hui-Ling Zhen , Mingxuan Yuan , Junchi Yan

The strength with which a statement is made can have a significant impact on the audience. For example, international relations can be strained by how the media in one country describes an event in another; and papers can be rejected…

Computation and Language · Computer Science 2014-06-03 Chenhao Tan , Lillian Lee

In the present paper, a robust approach to a special class of convex feasibility problems is considered. By techniques of convex and variational analysis, conditions for the existence of robust feasible solutions and related error bounds…

Optimization and Control · Mathematics 2025-05-06 Amos Uderzo

Understanding, finding, or even deciding on the existence of real solutions to a system of equations is a very difficult problem with many applications. While it is hopeless to expect much in general, we know a surprising amount about these…

Algebraic Geometry · Mathematics 2011-04-28 Frank Sottile

Impossibility results show that important fairness measures (independence, separation, sufficiency) cannot be satisfied at the same time under reasonable assumptions. This paper explores whether we can satisfy and/or improve these fairness…

Machine Learning · Computer Science 2022-03-21 Corinna Hertweck , Tim Räz

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Computational Geometry · Computer Science 2018-10-24 Bhaskar Bagchi , Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

We propose a definition of magnitude for a length space with a Borel measure, which involves integrals over the set of geodesics. This quantity agrees with the magnitude of finite metric spaces, up to re-scaling the metric to ensure the…

Differential Geometry · Mathematics 2026-05-25 Yoshinori Hashimoto

The concept of mass is central to any theory of gravity. Nevertheless, defining mass in general relativity is a difficult task, and even when it can be accomplished, we still need to investigate whether the typical properties of mass in…

General Relativity and Quantum Cosmology · Physics 2025-03-26 Níckolas de Aguiar Alves , Bruno Arderucio Costa

There are various approaches to the problem of how one is supposed to conduct a statistical analysis. Different analyses can lead to contradictory conclusions in some problems so this is not a satisfactory state of affairs. It seems that…

Statistics Theory · Mathematics 2019-06-25 Michael Evans

Given some set, how hard is it to construct a measure supported by it? We classify some variations of this task in the Weihrauch lattice. Particular attention is paid to Frostman measures on sets with positive Hausdorff dimension. As a side…

Logic in Computer Science · Computer Science 2014-09-12 Arno Pauly , Willem L. Fouché

As learning machines increase their influence on decisions concerning human lives, analyzing their fairness properties becomes a subject of central importance. Yet, our best tools for measuring the fairness of learning systems are rigid…

Machine Learning · Statistics 2022-07-21 David Lopez-Paz , Diane Bouchacourt , Levent Sagun , Nicolas Usunier
‹ Prev 1 8 9 10 Next ›