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

63127190253 · Jun 202019922001200920172026
48 results for choice potentials

OpFlow predicts robust OD flows by learning choice potentials conditioned on spatial exposures.

problem Deep models trained on raw counts are vulnerable to distribution shift.
method OpFlow learns row-centered choice potentials and reconstructs flows by combining them with a calibrated origin scale.
result OpFlow improves robustness under environment shifts, as shown by controlled synthetic shifts and a real-world experiment.

In this paper we study the phenomenon of phase transitions for the geodesic flow on some geometrically finite negatively curved manifolds. We define a class of potentials going slowly to zero through the cusps of MM for which the pressure map exhibits a phase transition. By a careful choice of the metric at the cusp w…

2017-04-09abs ↗pdf ↗

A generalization of Callias' index theorem for self adjoint Dirac operators with skew adjoint potentials on asymptotically conic manifolds is presented in which the potential term may have constant rank nullspace at infinity. The index obtained depends on the choice of a family of Fredholm extensions, though as in the …

2012-10-11abs ↗pdf ↗

A hierarchical clustering algorithm for data clouds without structure assumptions.

problem Exploring data clouds without making structure assumptions.
method Hierarchical topological clustering algorithm that infers persistence of outliers and clusters of arbitrary shape from data hierarchy.
result The algorithm can provide meaningful clusters in complex datasets.

This document is an invited chapter covering the specificities of ABC model choice, intended for the incoming Handbook of ABC by Sisson, Fan, and Beaumont (2017). Beyond exposing the potential pitfalls of ABC based posterior probabilities, the review emphasizes mostly the solution proposed by Pudlo et al. (2016) on the…

2015-03-26abs ↗pdf ↗

Graph neural networks improve residential location choice predictions.

problem Capturing spatial dependence in discrete choice models.
method Graph Neural Networks (GNN) for analyzing spatial alternatives.
result GNN-DCMs outperform classical models in residential location choice predictions.

Good predictors of ICU Mortality have the potential to identify high-risk patients earlier, improve ICU resource allocation, or create more accurate population-level risk models. Machine learning practitioners typically make choices about how to represent features in a particular model, but these choices are seldom eva…

2015-12-16abs ↗pdf ↗

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.

Within the context of risk integration, we introduce in risk measurement stochastic holding period (SHP) models. This is done in order to obtain a `liquidity-adjusted risk measure' characterized by the absence of a fixed time horizon. The underlying assumption is that - due to changes on market liquidity conditions - o…

2010-09-20abs ↗pdf ↗

A new method reduces high-dimensional state space for dynamic choice models.

problem Estimation of dynamic discrete choice models is computationally intensive and infeasible in high-dimensional settings.
method Recursive partitioning algorithm to reduce dimensionality of high-dimensional state space.
result Our method reduces estimation bias and makes estimation feasible.

We study the implicit bias of generic optimization methods, such as mirror descent, natural gradient descent, and steepest descent with respect to different potentials and norms, when optimizing underdetermined linear regression or separable linear classification problems. We explore the question of whether the specifi…

2018-02-22abs ↗pdf ↗

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 ↗

PO-Flow models potential and counterfactual outcomes for personalized treatment decisions.

problem Predicting individualized treatment effects from observational data.
method Continuous normalizing flow (CNF) framework for causal inference.
result Unified approach to potential outcome prediction, treatment effect estimation, and counterfactual prediction.

New formulations capture aversion to ambiguity about volatility.

problem Capturing aversion to ambiguity about unknown and time-varying volatility.
method Introduces novel preference formulations and compares them with existing models.
result Illustrates the impact of ambiguity aversion in static and dynamic models.

We discuss certain recent mathematical advances, mainly due to Perelman, in the theory of Ricci flows and their relevance for renormalization group (RG) flows. We consider nonlinear sigma models with closed target manifolds supporting a Riemannian metric, dilaton, and 2-form B-field. By generalizing recent mathematical…

2005-10-27abs ↗pdf ↗

We solve the problem of determining the fundamental degrees of freedom underlying a generalized Kähler structure of symplectic type. For a usual Kähler structure, it is well-known that the geometry is determined by a complex structure, a Kähler class, and the choice of a positive (1,1)(1,1)-form in this class, which depen…

2018-04-15abs ↗pdf ↗

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)$.

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.

Paper tackles optimal policy learning with observational data in multi-action scenarios.

problem Optimal policy learning in multi-action settings with observational data.
method Review of estimation approaches, analysis of risk preference, discussion of potential failures.
result Average regret of a policy with multi-valued treatment is contingent on the decision-maker's attitude towards risk.

We propose a new partially topological theory in three dimensions which couples Chern-Simons theory to matter. The 3-manifolds needed for this construction admit transverse holomorphic foliation (THF). The theory depends only on the choice of such a structure, but not on a choice of metric and in this sense, it is topo…

2017-06-29abs ↗pdf ↗

This study considers that the collective route choices of travelers en route represent a resolution of their competition on network routes. Well understanding this competition and coordinating their route choices help mitigate urban traffic congestion. Even though existing studies have developed such mechanisms (e.g., …

2019-11-12abs ↗pdf ↗

AI predicts medical specialty diagnostic choices from EHR records.

problem Predicting timely medical specialty diagnostic workups for patients.
method Ensemble of feed-forward neural networks trained on EHR data.
result Significantly higher accuracy compared to traditional checklists.

We consider nonlinear gauged sigma-models with Kahler domain and target. For a special choice of potential these models admit Bogomolny (or self-duality) equations -- the so-called vortex equations. We find the moduli space and energy spectrum of the solutions of these equations when the gauge group is a torus T^n, the…

2004-11-23abs ↗pdf ↗

Approximate Bayesian computation (ABC) methods provide an elaborate approach to Bayesian inference on complex models, including model choice. Both theoretical arguments and simulation experiments indicate, however, that model posterior probabilities may be poorly evaluated by standard ABC techniques. We propose a novel…

2014-06-24abs ↗pdf ↗

TDL uses topological features for deep learning models, promising new insights and solutions.

problem Lack of comprehensive theoretical foundations and practical benefits in TDL.
method Discussing open problems and potential solutions in TDL.
result TDL can complement existing graph and geometric learning methods.

Paper develops a new method for solving IBVPs on star-shaped domains.

problem Solving Inverse Boundary Value Problems (IBVP) for parallel transport equations.
method Covariant tomography, integrating geometric decomposition with specific interior extensions.
result Formal solvability criterion for higher-order IBVPs, validated through examples.

In this article, we address the question of how non-knowledge about future events that influence economic agents' decisions in choice settings has been formally represented in economic theory up to date. To position our discussion within the ongoing debate on uncertainty, we provide a brief review of historical develop…

2012-09-10abs ↗pdf ↗

Generative modelling is often cast as minimizing a similarity measure between a data distribution and a model distribution. Recently, a popular choice for the similarity measure has been the Wasserstein metric, which can be expressed in the Kantorovich duality formulation as the optimum difference of the expected value…

2019-10-09abs ↗pdf ↗

Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning models efficiently. First-order methods such as gradient descent are usually the methods of choice for training machine learning models. However, these methods converge to saddle points for certain ch…

2019-01-21abs ↗pdf ↗

Bayesian deep learning improves out-of-distribution detection but not always.

problem Improving the reliability of deep learning models in uncertain or novel data.
method Validation of likelihood-based Bayesian models for out-of-distribution detection.
result Bayesian deep learning models can marginally outperform conventional neural networks in certain conditions.

RUMBoost combines RUMs and deep learning for better choice modelling.

problem Creating interpretable and robust discrete choice models.
method Gradient Boosted Regression Trees for utility functions, with constraints for interpretability and monotonicity.
result RUMBoost outperforms ML and RUM benchmarks in predictive performance and interpretability.

Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…

2019-08-30abs ↗pdf ↗