Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

108217325433 · Jun 202019922001200920172026
48 results for information gathering

BED-LLM uses Bayesian experimental design to improve LLMs' information gathering.

problem Improving LLMs' ability to gather information adaptively.
method Iteratively choosing questions to maximize expected information gain using a probabilistic model.
result BED-LLM achieves substantial performance gains compared to other adaptive design strategies.

Paper simplifies complex AI exploration by predicting future rewards.

problem Training machines to optimally gather complex information.
method Developed a denser reward structure using cross-value to decouple exploration and exploitation.
result Demonstrated successful learning of challenging tasks without shaping or bonuses.

Study benchmarks label noise detection methods, identifying best practices.

problem Label noise in real-world datasets affects model performance and evaluation reliability.
method Decomposed detection methods into label agreement, aggregation, and information gathering components; introduced a unified benchmark task and novel metric.
result In-sample probability aggregation with logit margin label agreement function achieves best results across scenarios.

Foundation models struggle with multi-turn exploration but can learn through regular summaries.

problem Foundation models struggle with multi-turn exploration in dynamic environments.
method Implemented a text-based version of the Alchemy environment to test multi-trial learning. Prompting models to summarize their observations at regular intervals enabled them to improve across trials and adapt to changes.
result Foundation models can improve through regular summaries, enabling multi-trial learning and adaptation.

Study optimizes scoring rules for incentivizing agent's information gathering in online settings.

problem Optimizing incentives for agents to acquire information in online settings.
method Designing a sample-efficient algorithm that tailors the UCB algorithm to the strategic agent's model.
result Achieves sublinear T2/3T^{2/3}-regret after TT iterations, independent of the number of states.

Proposes a max-utility arm selection strategy for reducing cumulative regret in sequential query recommendations.

problem Reduces cumulative regret in sequential query recommendations for closed loop interactive learning settings.
method Proposes a max-utility arm selection strategy based on the maximum utility of arms.
result Improves cumulative regret substantially compared to baseline algorithms and random selection.

Aims to improve personalized treatment decisions through Bayesian experimental design.

problem Evaluating and improving personalized treatment decisions in contexts like customer service.
method Model-agnostic Bayesian Experimental Design to efficiently gather data and avoid highly sub-optimal treatments.
result Our method achieves superior performance in evaluating and improving treatment decisions compared to traditional approaches.

Data that is gathered adaptively --- via bandit algorithms, for example --- exhibits bias. This is true both when gathering simple numeric valued data --- the empirical means kept track of by stochastic bandit algorithms are biased downwards --- and when gathering more complicated data --- running hypothesis tests on c…

2018-06-06abs ↗pdf ↗

Bayesian BIC for multi-trial data improves VAR model order selection.

problem Optimal VAR model order selection for multi-trial event-based data.
method Derive and apply Bayesian Information Criterion (BIC) for multi-trial ensemble data.
result Multi-trial BIC successfully recovers real model order and estimates small model order.

Proposes EPIG for active learning to improve predictive performance.

problem Suboptimal predictive performance of traditional active learning methods.
method Introduces EPIG, a new acquisition function measuring information gain in the space of predictions.
result EPIG leads to stronger predictive performance compared to BALD across various datasets and models.

Applications of safety, security, and rescue in robotics, such as multi-robot target tracking, involve the execution of information acquisition tasks by teams of mobile robots. However, in failure-prone or adversarial environments, robots get attacked, their communication channels get jammed, and their sensors may fail…

2018-03-26abs ↗pdf ↗

A standard belief on emerging collective behavior is that it emerges from simple individual rules. Most of the mathematical research on such collective behavior starts from imperative individual rules, like always go to the center. But how could an (optimal) individual rule emerge during a short period within the group…

2018-02-21abs ↗pdf ↗

Part-of-speech (POS) tagging is a fundamental component for performing natural language tasks such as parsing, information extraction, and question answering. When POS taggers are trained in one domain and applied in significantly different domains, their performance can degrade dramatically. We present a methodology f…

2014-10-31abs ↗pdf ↗

In this paper we seek methods to effectively detect urban micro-events. Urban micro-events are events which occur in cities, have limited geographical coverage and typically affect only a small group of citizens. Because of their scale these are difficult to identify in most data sources. However, by using citizen sens…

2019-04-30abs ↗pdf ↗

Optimization of very expensive black-box functions requires utilization of maximum information gathered by the process of optimization. Model Guided Sampling Optimization (MGSO) forms a more robust alternative to Jones' Gaussian-process-based EGO algorithm. Instead of EGO's maximizing expected improvement, the MGSO use…

2015-08-31abs ↗pdf ↗

This work tackles online memory selection in continual learning using information theory.

problem Online selection of a representative replay memory from data streams.
method Information-theoretic criteria (surprise, learnability) and Bayesian model for efficient computation.
result InfoRS improves robustness against data imbalance compared to reservoir sampling.

In this article we propose a generalisation of the recent work of Gatheral and Jacquier on explicit arbitrage-free parameterisations of implied volatility surfaces. We also discuss extensively the notion of arbitrage freeness and Roger Lee's moment formula using the recent analysis by Roper. We further exhibit an arbit…

2012-10-26abs ↗pdf ↗

We introduce a probabilistic model of labor markets for university graduates, in particular, in Japan. To make a model of the market efficiently, we take into account several hypotheses. Namely, each company fixes the (business year independent) number of opening positions for newcomers. The ability of gathering newcom…

2013-09-20abs ↗pdf ↗

Privacy preserving networks can be modelled as decentralized networks (e.g., sensors, connected objects, smartphones), where communication between nodes of the network is not controlled by an all-knowing, central node. For this type of networks, the main issue is to gather/learn global information on the network (e.g.,…

2016-10-05abs ↗pdf ↗

As financial instruments grow in complexity more and more information is neglected by risk optimization practices. This brings down a curtain of opacity on the origination of risk, that has been one of the main culprits in the 2007-2008 global financial crisis. We discuss how the loss of transparency may be quantified …

2019-01-28abs ↗pdf ↗

In this short note, we prove by an appropriate change of variables that the SVI implied volatility parameterization presented in Gatheral's book and the large-time asymptotic of the Heston implied volatility agree algebraically, thus confirming a conjecture from Gatheral as well as providing a simpler expression for th…

2010-02-18abs ↗pdf ↗

Investment tool predicts higher returns for Madrid real estate units.

problem Determining which real estate units have higher returns to investment in Madrid.
method Data collection from Idealista.com, descriptive statistics, return index, machine learning algorithms.
result Introduction of machine learning algorithms for rental real estate price prediction.

To alleviate the burden of gathering detailed expert annotations when training deep neural networks, we propose a weakly supervised learning approach to recognize metastases in microscopic images of breast lymph nodes. We describe an alternative training loss which clusters weakly labeled bags in latent space to inform…

2018-11-28abs ↗pdf ↗

Distributed, online data mining systems have emerged as a result of applications requiring analysis of large amounts of correlated and high-dimensional data produced by multiple distributed data sources. We propose a distributed online data classification framework where data is gathered by distributed data sources and…

2013-07-02abs ↗pdf ↗

We propose a new framework for deriving screening rules for convex optimization problems. Our approach covers a large class of constrained and penalized optimization formulations, and works in two steps. First, given any approximate point, the structure of the objective function and the duality gap is used to gather in…

2016-09-23abs ↗pdf ↗

In an attempt to gather a deeper understanding of how convolutional neural networks (CNNs) reason about human-understandable concepts, we present a method to infer labeled concept data from hidden layer activations and interpret the concepts through a shallow decision tree. The decision tree can provide information abo…

2019-06-11abs ↗pdf ↗

Item cold-start is a classical issue in recommender systems that affects anime and manga recommendations as well. This problem can be framed as follows: how to predict whether a user will like a manga that received few ratings from the community? Content-based techniques can alleviate this issue but require extra infor…

2017-09-03abs ↗pdf ↗

To investigate objects without a describable notion of distance, one can gather ordinal information by asking triplet comparisons of the form "Is object xx closer to yy or is xx closer to zz?" In order to learn from such data, the objects are typically embedded in a Euclidean space while satisfying as many triplet …

2019-06-27abs ↗pdf ↗

This paper studies graphical model selection, i.e., the problem of estimating a graph of statistical relationships among a collection of random variables. Conventional graphical model selection algorithms are passive, i.e., they require all the measurements to have been collected before processing begins. We propose an…

2014-04-13abs ↗pdf ↗

This work defines a complexity measure for BAMDP planning and introduces state abstraction for more efficient approximate planning.

problem The computational intractability of exact BAMDP planning solutions.
method Define a complexity measure for BAMDP planning, introduce state abstraction, and develop an approximate planning algorithm.
result Introduces a computationally tractable approximate planning algorithm using state abstraction.

Designers of AI agents often iterate on the reward function in a trial-and-error process until they get the desired behavior, but this only guarantees good behavior in the training environment. We propose structuring this process as a series of queries asking the user to compare between different reward functions. Thus…

2018-09-09abs ↗pdf ↗

Modified model prevents volatility from approaching zero.

problem Volatility in the Gatheral model can approach zero, making it statistically indistinguishable.
method Proposed a modified model with Skorokhod reflection to prevent volatility from approaching zero.
result The modified model prevents volatility from approaching zero, preserving the model's flexibility.

New method estimates robust multi-period portfolios using entropy.

problem Lack of general agreement on building robust multi-period portfolios.
method Detrended cluster entropy approach to estimate portfolio weights.
result Portfolio weights are estimated reliably from real-world data at varying time horizons.

Increased data gathering capacity, together with the spread of data analytics techniques, has prompted an unprecedented concentration of information related to the individuals' preferences in the hands of a few gatekeepers. In the present paper, we show how platforms' performances still appear astonishing in relation t…

2019-03-27abs ↗pdf ↗