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

Trend · papers per month

213427640853 · Jun 202019922001200920172026
48 results for Optimal choice

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.

The paper proposes a new method to learn choice functions using Pareto-embeddings.

problem Learning subset choices from feature vectors.
method Embedding choice alternatives into a higher-dimensional utility space and identifying choice sets with Pareto-optimal points. Minimizing a differentiable loss function.
result The feasibility of learning a Pareto-embedding demonstrated on benchmark datasets.

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.

Study optimal portfolio choice with risk control for log-returns.

problem Optimal portfolio choice with risk management in continuous-time markets.
method Characterized optimal terminal wealth using concave envelope, derived analytical expressions for optimal wealth and policy, found efficient frontier.
result Efficient frontier is concave curve connecting minimum-risk to growth-optimal portfolios, not a vertical line.

Paper generalizes Markov chain model to handle dynamic preferences and choice overload.

problem Modeling dynamic customer substitution behavior in assortment optimization.
method Generalizes Markov chain model to account for choice overload.
result Proposes a Markov chain model that reduces to a generalized MNL model with assortment-dependent no-purchase attractions.

Paper studies optimal investing for retirees with risk constraints.

problem Retirees' longevity and living standard risks in a fluctuating market.
method Formulated as a portfolio choice problem under time-varying risk capacity constraint. Derived optimal investment strategy using differential equations. Demonstrated endogenous spending measure and active investment strategy.
result Time-varying risk capacity constraint impacts asset allocation in retirement.

DMNL bandits optimize assortment choices balancing relevance and diversity.

problem Balancing relevance-driven choice with within-assortment diversity.
method Augments MNL choice probabilities with a submodular diversity function, proposing a white-box UCB-based algorithm.
result Achieves at least a (11e+1)(1-\frac{1}{e+1})-approximate regret bound of $ ilde{O}\left(d \sqrt{T/K} ight)$.

Novel risk matrix for optimal portfolio choice with tail risk considerations.

problem Optimal portfolio choice with tail risk events.
method Risk matrix with Value-at-Risk and Delta-CoVaR measures, derived conditions for closed-form solution, examination of portfolio risk and centrality, demonstration of asset centrality's impact on optimal weight allocation.
result Portfolio risk is not necessarily increasing with stock centrality and can be improved by high connectivity.

Proposes robust assortment optimization from observational data.

problem Real-world scenarios often violate assumptions of stable customer preferences and correct choice models.
method Develops a robust framework that accounts for potential distributional shifts in customer choice behavior.
result Uncovered the notion of ``robust item-wise coverage'' as the minimal data requirement for sample-efficient robust assortment learning.

When applying machine learning to problems in NLP, there are many choices to make about how to represent input texts. These choices can have a big effect on performance, but they are often uninteresting to researchers or practitioners who simply need a module that performs well. We propose an approach to optimizing ove…

2015-03-02abs ↗pdf ↗

Many applications in preference learning assume that decisions come from the maximization of a stable utility function. Yet a large experimental literature shows that individual choices and judgements can be affected by "irrelevant" aspects of the context in which they are made. An important class of such contexts is t…

2019-02-08abs ↗pdf ↗

Optimizes Metropolis-Hastings algorithms for efficient sampling in high dimensions.

problem Efficiently sampling from complex target distributions in high-dimensional spaces.
method Analyzes and optimizes the Barker proposal and other locally-balanced algorithms.
result Derives optimal noise distribution and balancing function for the Barker proposal.

Paper tackles RLHF with DCPPO method, proving near-optimal suboptimality.

problem Challenges in offline RLHF with limited human feedback and bounded rationality.
method DCPPO method involving three stages: MLE, reward function recovery, and pessimistic value iteration.
result DCPPO's suboptimality almost matches classical pessimistic offline RL in terms of distribution shift and dimension.

We propose a modelling framework for the optimal selection of crypto assets. Crypto assets differ by two essential features: security (technological) and stability (governance). Investors make choices over crypto assets similarly to how they make choices by using a recommender app: the app presents each investor with a…

2019-06-23abs ↗pdf ↗

Many investment models in discrete or continuous-time settings boil down to maximizing an objective of the quantile function of the decision variable. This quantile optimization problem is known as the quantile formulation of the original investment problem. Under certain monotonicity assumptions, several schemes to so…

2014-03-28abs ↗pdf ↗

Optimizes assortment decisions with a new OFU scheme for online choice problems.

problem Online assortment optimization under stochastic choice with revenue performance and inference quality considerations.
method Forced-exploration OFU scheme combining regularized estimators for decision making and inference.
result Explicit regret bound and error bounds for approximate optimistic actions, showing Pareto optimality.

Optimal adaptive experiment for choosing best treatment with binary outcomes.

problem Choosing the best treatment from binary options in an adaptive experiment.
method Adaptive experiment with two phases: treatment allocation and choice. Neyman allocation method used.
result Neyman allocation is minimax and Bayes optimal, matching lower bounds for regret.

This paper solves optimal consumption-investment choices with wealth-driven risk aversion using neural networks.

problem Optimal consumption-investment choices under wealth-driven risk aversion.
method Neural network LSTM trained on jump-diffusion model data to optimize investment rate and consumption.
result Neural network approach shows promising results in solving the investment problem.

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 ↗

GPs' decisions can vary significantly with different kernels, even if kernels are qualitatively similar.

problem Robustness of GP decisions to kernel choice.
method Solved a constrained optimization problem over a finite-dimensional space to identify changes in GP decisions.
result Decisions made with a GP can be non-robust to kernel choice, even with qualitatively similar kernels.

Study on Spanish households' investment choices in housing, deposits, and stocks.

problem Investment decisions of Spanish households in housing, deposits, and stocks.
method Theoretical model considering indivisible and illiquid housing assets, financial constraints, and actual choices compared.
result Households underinvest in stocks and deposits compared to optimal choices, but mortgage investments are efficient.

The paper analyzes optimal investment strategies for life insurance contracts using mean-variance optimization.

problem Optimal portfolio choice for equity holders in life insurance contracts.
method Mean-variance optimization, explicit formulas, Hamilton-Jacobi-Bellman equations, numerical analysis.
result Equity holders increase investment in risky assets during economic downturns.

We consider optimal consumption and portfolio choice in the presence of Knightian uncertainty in continuous-time. We embed the problem into the new framework of stochastic calculus for such settings, dealing in particular with the issue of non-equivalent multiple priors. We solve the problem completely by identifying t…

2014-01-08abs ↗pdf ↗

Proposes a new method for better explaining neural network decisions.

problem Challenges in explaining neural network decisions due to base-point choice.
method Introduces tangentially aligned integrated gradients to maximize explanation tangential alignment.
result Optimal base-point maximizes explanation tangential alignment, leading to more accurate interpretations.

Assuming that agents' preferences satisfy first-order stochastic dominance, we show how the Expected Utility paradigm can rationalize all optimal investment choices: the optimal investment strategy in any behavioral law-invariant (state-independent) setting corresponds to the optimum for an expected utility maximizer w…

2013-02-19abs ↗pdf ↗

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.