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

Trend · papers per month

150300449599 · Jun 202019922001200920172026
48 results for state ambiguity

Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.

problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.

A firm with heterogeneous shareholders optimizes dividends under ambiguity aggregation.

problem Optimizing dividends for a firm with heterogeneous shareholders under ambiguity aggregation.
method Characterizing equilibrium dividends using a partition of the state space.
result Time-homogeneous equilibrium dividend law characterized by a partition of the state space.

The paper solves TIC LQ control problems using stochastic differential games.

problem Time-inconsistent linear-quadratic stochastic control problems.
method Stochastic differential games, spike variation approach.
result Achieves Nash equilibrium for TIC problems, demonstrating impact of ambiguity aversion.

List-wise learning to rank methods are considered to be the state-of-the-art. One of the major problems with these methods is that the ambiguous nature of relevance labels in learning to rank data is ignored. Ambiguity of relevance labels refers to the phenomenon that multiple documents may be assigned the same relevan…

2017-07-24abs ↗pdf ↗

Proposes a method to learn adaptive ambiguity sets for robust optimization.

problem Misspecification in distributionally robust optimization (DRO).
method Learned predictive ambiguity sets (LPAS) using deep contextual models.
result Significantly improves portfolio optimization performance compared to baselines.

Investment strategy in uncertain markets improved by learning and risk-ambiguity preferences.

problem Investment in financial markets with unknown drift coefficients.
method Optimization under KMM approach, considering risk and ambiguity preferences.
result Optimal investment strategy can be adjusted based on prior drift distribution.

Quantum computing speeds up asset pricing models exponentially.

problem Solving dynamic nonlinear asset pricing models efficiently.
method Utilizes quantum superposition and entanglement to solve models exponentially faster than classical methods.
result Exponential computational speed-up for solving asset pricing models.

The state sums defining the quantum hyperbolic invariants (QHI) of hyperbolic oriented cusped 33-manifolds can be split in a "symmetrization" factor and a "reduced" state sum. We show that these factors are invariants on their own, that we call "symmetry defects" and "reduced QHI", provided the manifolds are endowed w…

2015-06-03abs ↗pdf ↗

In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …

2016-08-22abs ↗pdf ↗

Study insurance pricing under correlation ambiguity without increasing prices or reducing utility.

problem Understanding the dependence structure between insurance and financial risks.
method Dynamic equilibrium analysis of insurance pricing with worst-case beliefs.
result Correlation ambiguity does not necessarily increase insurance prices or reduce insurers' utility.

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.

A framework for robust exploration in reinforcement learning under ambiguity.

problem Optimal stopping under ambiguity in reinforcement learning.
method Continuous-time robust reinforcement learning framework using gg-expectation and backward stochastic differential equations.
result Constructs a robust exploratory stopping time approximating the optimal stopping time under ambiguity.

Study on robust utility maximization with nonconcave utility functions under projective determinacy.

problem Investor's optimal investment strategy under model ambiguity and nonconcave utility.
method Projective functions of the path and sets of priors, upper-semicontinuous utility.
result Existence of optimal investment strategy under PD.

Study inert and ambiguous classes in modular group using combinatorial methods.

problem Counting inert and ambiguous conjugacy classes in modular group.
method Purely combinatorial approach using word length in free product representation.
result Exact counting formulas and asymptotic growth rates for inert and ambiguous classes.

Linear recurrent networks explain reinforcement learning performance in partially observable settings.

problem Understanding why linear recurrent networks work in reinforcement learning with partial observability.
method Constructed and studied two linear filters for HMMs and action-controlled HMMs.
result Linear filters serve as sufficient statistics and reduce state ambiguity, explaining empirical reinforcement learning success.

We study the dynamic indifference pricing with ambiguity preferences. For this, we introduce the dynamic expected utility with ambiguity via the nonlinear expectation--G-expectation, introduced by Peng (2007). We also study the risk aversion and certainty equivalent for the agents with ambiguity. We obtain the dynamic …

2015-03-30abs ↗pdf ↗

Paper investigates Lambda Value-at-Risk under ambiguity and risk sharing.

problem Investigates Lambda Value-at-Risk under ambiguity and risk sharing.
method Establishes equivalence of robust ΛΛVaR and traditional ΛΛVaR under ambiguity sets, analyzes properties, derives explicit formulas, and explores risk sharing.
result Unified and extended the concept of Value-at-Risk under ambiguity, derived explicit formulas for specific ambiguity sets, and explored risk sharing.

ST-MAML tackles task ambiguity in meta-learning by encoding tasks with stochastic representations.

problem Handling tasks from multiple distributions is challenging for meta-learning due to task ambiguity.
method ST-MAML uses a stochastic neural network module to encode tasks and propagate task representations to revise input variable encoding.
result ST-MAML matches or outperforms state-of-the-art methods on various tasks.

Improves DRO with Bayesian Ambiguity Sets for model misspecification.

problem Overly conservative decisions due to misspecified models in DRO.
method Introduces DRO-RoBAS with robust posterior predictive distribution.
result Outperforms other Bayesian and empirical DRO approaches in out-of-sample performance.

Study optimal timing to divest from assets with uncertain future scenarios.

problem Optimal timing to divest from assets with uncertain future scenarios.
method Smooth model of decision making under ambiguity aversion, optimal stopping problem with learning.
result Proves a minimax result reducing the problem to standard optimal stopping problems with learning.

Optimal policies in Markov decision processes (MDPs) are very sensitive to model misspecification. This raises serious concerns about deploying them in high-stake domains. Robust MDPs (RMDP) provide a promising framework to mitigate vulnerabilities by computing policies with worst-case guarantees in reinforcement learn…

2019-12-04abs ↗pdf ↗

Paper develops online learning-based risk-averse MPC for uncertain systems.

problem Designing robust MPC for systems with unknown but inferable stochastic disturbances.
method Proposes a novel online learning framework using CVaR constraints and Dirichlet process mixture models.
result Demonstrates improved robustness and adaptability of MPC in handling time-varying disturbance distributions.

Identifying emotion from speech is a non-trivial task pertaining to the ambiguous definition of emotion itself. In this work, we adopt a feature-engineering based approach to tackle the task of speech emotion recognition. Formalizing our problem as a multi-class classification problem, we compare the performance of two…

2019-04-12abs ↗pdf ↗

This paper compares different DRO formulations for pension fund management.

problem Navigating uncertainty in asset liability management for pension funds.
method Three DRO formulations: mixture, box, and Wasserstein ambiguity sets.
result Wasserstein and box ambiguity sets outperform traditional approaches in fund performance.

Adapts AUM to identify ambiguous tasks in crowdsourced learning, improving generalization.

problem Discerning ambiguous tasks in crowdsourced labels to prevent mislabeling.
method Introduces Weighted Areas Under the Margin (WAUM) to average AUMs weighted by task-specific scores.
result Improves generalization performance by discarding ambiguous tasks.

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 ↗

Paper tackles robust control of SDEs with ambiguity, proving value function existence and applying to investment problems.

problem Robust control of SDEs with ambiguity parameters and non-Lipschitz coefficients.
method Existence and uniqueness of value function established through BSDEs with non-linear growth conditions.
result Existence and uniqueness of value function in proper space, verified through BSDEs.

This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.

problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.

We introduce a measure to quantify ambiguity in deep learning models, improving their reliability.

problem Deep learning models make mistakes on seemingly trivial cases and fail in recognizing what they don't know.
method We define ambiguity based on decision boundaries and convex hulls in feature space, developing a theoretical framework to identify unknowns.
result A single ambiguity measure can detect a significant portion of model mistakes, including adversarial and out-of-distribution inputs.