English
Related papers

Related papers: Information Acquisition Under Resource Limitations…

200 papers

In many real-world scenarios where data is high dimensional, test time acquisition of features is a non-trivial task due to costs associated with feature acquisition and evaluating feature value. The need for highly confident models with an…

Machine Learning · Computer Science 2019-09-17 Orpaz Goldstein , Mohammad Kachuee , Kimmo Karkkainen , Majid Sarrafzadeh

This paper considers the problem of acquiring an unknown target location (among a finite number of locations) via a sequence of measurements, where each measurement consists of simultaneously probing a group of locations. The resulting…

Information Theory · Computer Science 2019-01-30 Anusha Lalitha , Nancy Ronquillo , Tara Javidi

What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the answer depends on the prior expectations of the dynamics of…

Other Quantitative Biology · Quantitative Biology 2007-05-23 Gurinder Singh Atwal , William Bialek

We show that the way in which the Shannon entropy of sequences produced by an information source converges to the source's entropy rate can be used to monitor how an intelligent agent builds and effectively uses a predictive model of its…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 James P. Crutchfield , David P. Feldman

Modern information retrieval (IR) is no longer consumed primarily by humans but increasingly by large language models (LLMs) via retrieval-augmented generation (RAG) and agentic search. Unlike human users, LLMs are constrained by limited…

Information Retrieval · Computer Science 2026-05-19 Lu Dai , Liang Sun , Fanpu Cao , Ziyang Rao , Cehao Yang , Hao Liu , Hui Xiong

Typical properties of computing circuits composed of noisy logical gates are studied using the statistical physics methodology. A growth model that gives rise to typical random Boolean functions is mapped onto a layered Ising spin system,…

Disordered Systems and Neural Networks · Physics 2015-05-18 Alexander Mozeika , David Saad , Jack Raymond

We study the problem of learning exploration-exploitation strategies that effectively adapt to dynamic environments, where the task may change over time. While RNN-based policies could in principle represent such strategies, in practice…

We explore a model of non-Bayesian information aggregation in networks. Agents non-cooperatively choose among Friedkin-Johnsen type aggregation rules to maximize payoffs. The DeGroot rule is chosen in equilibrium if and only if there is…

General Economics · Economics 2023-11-15 Abhijit Banerjee , Olivier Compte

The optimal selection of experimental conditions is essential to maximizing the value of data for inference and prediction, particularly in situations where experiments are time-consuming and expensive to conduct. We propose a general…

Machine Learning · Statistics 2012-12-04 Xun Huan , Youssef M. Marzouk

Solving real-life sequential decision making problems under partial observability involves an exploration-exploitation problem. To be successful, an agent needs to efficiently gather valuable information about the state of the world for…

Machine Learning · Computer Science 2020-11-03 Haiyan Yin , Yingzhen Li , Sinno Jialin Pan , Cheng Zhang , Sebastian Tschiatschek

We study a fundamental problem in optimization under uncertainty. There are $n$ boxes; each box $i$ contains a hidden reward $x_i$. Rewards are drawn i.i.d. from an unknown distribution $\mathcal{D}$. For each box $i$, we see $y_i$, an…

Computer Science and Game Theory · Computer Science 2023-07-13 Kamyar Azizzadenesheli , Trung Dang , Aranyak Mehta , Alexandros Psomas , Qian Zhang

When reasoning about strategic behavior in a machine learning context it is tempting to combine standard microfoundations of rational agents with the statistical decision theory underlying classification. In this work, we argue that a…

Machine Learning · Computer Science 2021-06-25 Meena Jagadeesan , Celestine Mendler-Dünner , Moritz Hardt

Autonomous exploration in mobile robotics often involves a trade-off between two objectives: maximizing environmental coverage and minimizing the total path length. In the widely used information gain paradigm, exploration is guided by the…

Robotics · Computer Science 2025-04-22 Ludvig Ericson , José Pedro , Patric Jensfelt

Sequential maximization of expected improvement (EI) is one of the most widely used policies in Bayesian optimization because of its simplicity and ability to handle noisy observations. In particular, the improvement function often uses the…

Machine Learning · Computer Science 2023-11-15 Han Zhou , Xingchen Ma , Matthew B Blaschko

Active Feature Acquisition is an instance-wise, sequential decision making problem. The aim is to dynamically select which feature to measure based on current observations, independently for each test instance. Common approaches either use…

Machine Learning · Computer Science 2025-08-07 Alexander Norcliffe , Changhee Lee , Fergus Imrie , Mihaela van der Schaar , Pietro Lio

Human agents routinely reason on instances with incomplete and muddied data (and weigh the cost of obtaining further features). In contrast, much of ML is devoted to the unrealistic, sterile environment where all features are observed and…

Machine Learning · Computer Science 2024-10-08 Yang Li , Junier Oliva

Falsely annotated samples, also known as noisy labels, can significantly harm the performance of deep learning models. Two main approaches for learning with noisy labels are global noise estimation and data filtering. Global noise…

Machine Learning · Computer Science 2025-07-31 Yuval Grinberg , Nimrod Harel , Jacob Goldberger , Ofir Lindenbaum

Information theory has explained the organization of many biological phenomena, from the physiology of sensory receptive fields to the variability of certain DNA sequence ensembles. Some scholars have proposed that information should…

Other Quantitative Biology · Quantitative Biology 2010-10-25 Edward K. Agarwala , Hillel J. Chiel , Peter J. Thomas

Reinforcement Learning agents are expected to eventually perform well. Typically, this takes the form of a guarantee about the asymptotic behavior of an algorithm given some assumptions about the environment. We present an algorithm for a…

Machine Learning · Computer Science 2020-04-02 Michael K. Cohen , Elliot Catt , Marcus Hutter

We study the problem of learning an unknown mixture of $k$ rankings over $n$ elements, given access to noisy samples drawn from the unknown mixture. We consider a range of different noise models, including natural variants of the "heat…

Machine Learning · Computer Science 2018-11-06 Anindya De , Ryan O'Donnell , Rocco Servedio