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,878 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for information choice

Choice models, which capture popular preferences over objects of interest, play a key role in making decisions whose eventual outcome is impacted by human choice behavior. In most scenarios, the choice model, which can effectively be viewed as a distribution over permutations, must be learned from observed data. The ob…

2010-11-19abs ↗pdf ↗

The paper introduces V(I) to guide algorithm choice and parameter tuning in financial forecasting.

problem Selecting optimal algorithms and tuning parameters for financial time-series forecasting.
method Estimating Shannon's mutual information and using it to define performance bounds.
result Illustrates the value of information for mean-square error minimization in cryptocurrency forecasts.

Simple algorithms identify best items or full rankings from choice-based feedback.

problem Learning to identify the best item or full ranking from choice-based feedback.
method Nested Elimination (NE) and Nested Partition (NP) algorithms.
result NE is worst-case asymptotically optimal, NP is optimal up to a constant factor.

Proposes new methods for Markov chain choice models with panel data.

problem Dependence among transactions for the same customer in historical data.
method Expectation-maximization (EM) algorithms incorporating partial-ordering preference information.
result EM algorithms outperform traditional methods on synthetic and real datasets.

New method automates asymmetric choice for better skill transfer in reinforcement learning.

problem Improving sample efficiency and transferability of reinforcement learning agents.
method Attentive Priors for Expressive and Transferable Skills (APES) using hierarchical KL-regularization.
result APES automates asymmetric choice, leading to better skill transfer across sequential tasks.

Information-theoretic Bayesian optimisation techniques have demonstrated state-of-the-art performance in tackling important global optimisation problems. However, current information-theoretic approaches require many approximations in implementation, introduce often-prohibitive computational overhead and limit the choi…

2017-11-02abs ↗pdf ↗

Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.

problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.

Individual choices are either based on personal experience or on information provided by peers. The latter case, causes individuals to conform to the majority in their neighborhood. Such herding behavior may be very efficient in aggregating disperse private information, thereby revealing the optimal choice. However if …

2005-06-17abs ↗pdf ↗

The theory of rational choice assumes that when people make decisions they do so in order to maximize their utility. In order to achieve this goal they ought to use all the information available and consider all the choices available to choose an optimal choice. This paper investigates what happens when decisions are m…

2017-03-29abs ↗pdf ↗

We introduce a semi-supervised discrete choice model to calibrate discrete choice models when relatively few requests have both choice sets and stated preferences but the majority only have the choice sets. Two classic semi-supervised learning algorithms, the expectation maximization algorithm and the cluster-and-label…

2017-02-16abs ↗pdf ↗

Binary choice forests model customer choices in retailing.

problem Estimating DCMs using transaction data is challenging and prone to misspecification.
method Random forest of binary decision trees to represent DCMs, interpretable and consistent predictions.
result Random forest can predict choice probabilities and assortments unseen in training data.

The paper tackles interpreting DCM with image data by addressing data isomorphism.

problem Interpreting DCM with image data due to isomorphic information.
method Proposes and benchmarks two methodologies: architectural adjustments and data source mitigation.
result Direct data source mitigation is more effective for maintaining DCM's interpretability.

Generative model captures how individuals process travel information under uncertainty.

problem Travel decisions are sensitive to uncertainty and information processing constraints.
method Data-driven generative learning model based on rational inattention theory.
result Generative model demonstrates strong correlation with rational inattention theory.

Bayesian methods detect significant IIA violations in similarity choice data.

problem Detecting IIA violations in similarity choice data complicates classical models.
method Proposed two statistical methods: classical goodness-of-fit test and Bayesian PPC.
result Significant IIA violations confirmed in both datasets, driven by context effects.

Algorithm maximizes revenue from user choices with contextual information.

problem Maximizing revenue from user choices with contextual preference information.
method Proposes an algorithm that learns from user feedback and achieves a revenue regret of order \( \widetilde{O}(d \sqrt{K T} / L_0 ) \).
result Achieves a revenue regret of order \( \widetilde{O}(d \sqrt{K T} / L_0 ) \) and a lower bound of order \( \Omega(d \sqrt{T}/ L_0) \).

Observation of the workings of productive organizations shows that the characteristics of a trade, backed by nature given to a technological environment, determine the productive combination implemented by the decision maker, and the structure of the operating cycle which is related. The choice of the production functi…

2012-02-09abs ↗pdf ↗

aMCL uses annealing to improve hypothesis diversity in ambiguous tasks.

problem Limitations of Winner-takes-all in predicting plausible hypotheses.
method Combines simulated annealing with Multiple Choice Learning (MCL).
result Enhanced exploration of hypothesis space during training.

We develop a probabilistic consumer choice framework based on information asymmetry between consumers and firms. This framework makes it possible to study market competition of several firms by both quality and price of their products. We find Nash market equilibria and other optimal strategies in various situations ra…

2013-12-13abs ↗pdf ↗

New framework explains neural network bias in solving differential equations.

problem Understanding and controlling the bias in PINNs for differential equations.
method Deriving an integro-differential equation from PINNs and GPR equivalence.
result PINN predictions are influenced by a kernel term reflecting architecture choices.

Study dynamic portfolio choice under rotating drivers, revealing a new geometric structure.

problem Investment under changing drivers with mutual independence.
method Analyzes geometric structure of portfolio choice, focusing on drivers and their rotation.
result Optimal policy separates into static and hedging components, reflecting the dynamic nature of drivers.

New mutual information framework improves contrastive learning for vision tasks.

problem Maximizing mutual information for better unsupervised learning representations.
method Reformulated mutual information as a lower bound, introducing new negative sampling strategies.
result Improved representations outperform previous methods in various vision tasks.

Dynamic assortment problem on two-sided platform with unknown parameters

problem Optimizing assortment display in an online platform with incomplete information and heterogeneous customers
method Data-driven algorithm that learns choice parameters while optimizing revenue
result Worst-case regret grows polylogarithmically over time

Optimal portfolio choice with cross-impact propagators, solving complex equations.

problem Maximizing revenue-risk in a continuous-time portfolio choice problem with cross-impact.
method Formulated as a maximization problem, solved explicitly using operator resolvents and stochastic Fredholm equations.
result Sufficient conditions for the absence of price manipulation, providing financial insights.

In this paper, we study the dynamic assortment optimization problem under a finite selling season of length TT. At each time period, the seller offers an arriving customer an assortment of substitutable products under a cardinality constraint, and the customer makes the purchase among offered products according to a d…

2018-10-31abs ↗pdf ↗

A distributed method for Bayesian model choice using marginal likelihood and Monte Carlo sampling.

problem Bayesian model choice in large datasets with limited communication.
method Split data into subsets, locally compute model evidence, combine results using summary statistics.
result The method enables model choice in large datasets with speed-ups and theoretical error bounds.

Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints - i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predic…

2016-10-06abs ↗pdf ↗

Recent character and phoneme-based parametric TTS systems using deep learning have shown strong performance in natural speech generation. However, the choice between character or phoneme input can create serious limitations for practical deployment, as direct control of pronunciation is crucial in certain cases. We dem…

2018-11-17abs ↗pdf ↗

In this paper we consider an information theoretic approach for the accounting classification process. We propose a matrix formalism and an algorithm for calculations of information theoretic measures associated to accounting classification. The formalism may be useful for further generalizations and computer-based imp…

2014-01-13abs ↗pdf ↗

Additive Bayesian networks are types of graphical models that extend the usual Bayesian generalized linear model to multiple dependent variables through the factorisation of the joint probability distribution of the underlying variables. When fitting an ABN model, the choice of the prior of the parameters is of crucial…

2018-09-18abs ↗pdf ↗

There is a consensus that human and non-human subjects experience temporal distortions in many stages of their perceptual and decision-making systems. Similarly, intertemporal choice research has shown that decision-makers undervalue future outcomes relative to immediate ones. Here we combine techniques from informatio…

2016-04-18abs ↗pdf ↗