English
Related papers

Related papers: Efficient Implementation and the Product State Rep…

200 papers

Decision-makers often act in response to data-driven predictions, with the goal of achieving favorable outcomes. In such settings, predictions don't passively forecast the future; instead, predictions actively shape the distribution of…

Machine Learning · Computer Science 2023-01-10 Michael P. Kim , Juan C. Perdomo

Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…

Logic in Computer Science · Computer Science 2019-03-13 Antonino Leonardis , Gianfranco D'Atri , Fabio Caldarola

Mathematics is a limited component of solutions to real-world problems, as it expresses only what is expected to be true if all our assumptions are correct, including implicit assumptions that are omnipresent and often incorrect.…

Methodology · Statistics 2023-09-14 Sander Greenland

In considering the reliability of numerical programs, it is normal to "limit our study to the semantics dealing with numerical precision" (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that…

Symbolic Computation · Computer Science 2014-04-25 James H. Davenport , Russell Bradford , Matthew England , David Wilson

Numbers are a basic part of how humans represent and describe the world around them. As a consequence, learning effective representations of numbers is critical for the success of large language models as they become more integrated into…

Computation and Language · Computer Science 2025-02-04 Raja Marjieh , Veniamin Veselovsky , Thomas L. Griffiths , Ilia Sucholutsky

Deployed supervised machine learning models make predictions that interact with and influence the world. This phenomenon is called performative prediction by Perdomo et al. (ICML 2020). It is an ongoing challenge to understand the influence…

Machine Learning · Computer Science 2022-02-24 Gavin Brown , Shlomi Hod , Iden Kalemaj

Interactive theorem provers have been used extensively to reason about various software/hardware systems and mathematical theorems. The key challenge when using an interactive prover is finding a suitable sequence of proof steps that will…

Logic in Computer Science · Computer Science 2014-05-15 Thomas Gransden , Neil Walkinshaw , Rajeev Raman

High Performance Distributed Computing is essential to boost scientific progress in many areas of science and to efficiently deploy a number of complex scientific applications. These applications have different characteristics that require…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-12-04 Mariza Ferro , Antonio R. Mury , Laion F. Manfroi , Bruno Schlze

This work continues the development of an intensional approach to computability initiated in previous work, in which programs and computations, rather than functions, constitute the primary objects of study. In this setting, models of…

Logic in Computer Science · Computer Science 2026-05-19 Thomas Seiller

A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…

Computational Complexity · Computer Science 2019-10-23 Michal Konečný , Eike Neumann

In this extended abstract, we discuss the opportunity to formally verify that inference systems for probabilistic programming guarantee good performance. In particular, we focus on hybrid inference systems that combine exact and approximate…

Programming Languages · Computer Science 2023-07-17 Eric Atkinson , Ellie Y. Cheng , Guillaume Baudart , Louis Mandel , Michael Carbin

We argue that it is neither necessary nor sufficient for a mathematical proof to have epistemic value that it be "correct", in the sense of formalizable in a formal proof system. We then present a view on the relationship between…

History and Overview · Mathematics 2026-02-16 James Owen Weatherall , Jesse Wolfson

We present a simple yet general and efficient approach to representation of computational meshes. Meshes are represented as sets of mesh entities of different topological dimensions and their incidence relations. We discuss a…

Numerical Analysis · Mathematics 2012-05-15 Anders Logg

The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by means of ensembles, that is probability distributions on…

Information Theory · Computer Science 2015-05-18 Nihat Ay , Markus Mueller , Arleta Szkola

Recently, scholars from law and political science have introduced metrics which use only election outcomes (and not district geometry) to assess the presence of partisan gerrymandering. The most high-profile example of such a tool is the…

Physics and Society · Physics 2018-03-15 Ellen Veomett

The best empirical research in political science clearly defines substantive parameters of interest, presents a set of assumptions that guarantee its identification, and uses an appropriate estimator. We argue for the importance of…

Methodology · Statistics 2023-02-06 Nathan Canen , Kristopher Ramsay

Analyzing decision problems under uncertainty commonly relies on idealizing assumptions about the describability of the world, with the most prominent examples being the closed world and the small world assumption. Most assumptions are…

Methodology · Statistics 2025-12-08 Christoph Jansen , Georg Schollmeyer , Thomas Augustin , Julian Rodemann

Mutual Information between agent Actions and environment States (MIAS) quantifies the influence of agent on its environment. Recently, it was found that the maximization of MIAS can be used as an intrinsic motivation for artificial agents.…

Machine Learning · Computer Science 2020-08-04 Ruihan Zhao , Stas Tiomkin , Pieter Abbeel

This paper formally proposes a problem about the efficient utilization of the four dimensional space-time. Given a cuboid container, a finite number of rigid cuboid items, and the time length that each item should be continuous baked in the…

Computational Complexity · Computer Science 2015-01-26 Wenqi Huang , Kun He

Many statistical estimators are defined as the fixed point of a data-dependent operator, with estimators based on minimizing a cost function being an important special case. The limiting performance of such estimators depends on the…

Machine Learning · Computer Science 2022-03-22 Nhat Ho , Koulik Khamaru , Raaz Dwivedi , Martin J. Wainwright , Michael I. Jordan , Bin Yu