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

Trend · papers per month

3767521,1281,504 · Jun 202019922001200920172026
48 results for dynamic trust model

Trust-aware MAB improves learning performance by accounting for human deviation.

problem Learning performance suffers when humans deviate from recommended policies due to lack of trust.
method Integrates a dynamic trust model into MAB framework, establishing minimax regret and proposing a two-stage trust-aware procedure.
result Proves near-optimal statistical guarantees for trust-aware MAB algorithms.

Study finds significant price declines and capital reallocation from centralized to decentralized exchanges after FTX collapse.

problem Quantifying trust dynamics and redistribution between centralized and decentralized exchanges.
method Interdisciplinary approach combining causal inference and computational text analysis.
result Significant price declines and capital reallocation from centralized to decentralized exchanges following the FTX collapse.

A macroeconomic model based on the economic variables (i) assets, (ii) leverage (defined as debt over asset) and (iii) trust (defined as the maximum sustainable leverage) is proposed to investigate the role of credit in the dynamics of economic growth, and how credit may be associated with both economic performance and…

2015-12-11abs ↗pdf ↗

AdaScale-TuRBO improves high-dimensional Bayesian optimization by dynamically scaling the GP lengthscale.

problem Inappropriate lengthscale design in TuRBO's local GP model causes suboptimal performance in high dimensions.
method Proposes AdaScale-TuRBO, which scales the GP lengthscale with both problem dimension and trust region size.
result AdaScale-TuRBO robustly outperforms standard TuRBO and other methods on synthetic and real-world tasks.

We propose to improve trust region policy search with normalizing flows policy. We illustrate that when the trust region is constructed by KL divergence constraints, normalizing flows policy generates samples far from the 'center' of the previous policy iterate, which potentially enables better exploration and helps av…

2018-09-27abs ↗pdf ↗

We present a simple dynamical model for describing trading interactions between agents in a social network by considering only two dynamical variables, namely money and goods or services, that are assumed conserved over the whole time span of the agents' trading transactions. A key feature of the model is that agent-to…

2016-05-28abs ↗pdf ↗

Study explores fairness in financial deep learning through multi-scale trust quantification.

problem Ensuring fairness in financial deep learning models, especially under regulatory compliance.
method Conducts multi-scale trust quantification on a deep neural network for credit card default prediction.
result Demonstrates the feasibility and utility of multi-scale trust quantification for financial deep learning fairness.

New trust matrix quantifies breakdowns in deep neural networks.

problem Understanding trust breakdowns in deep learning models.
method Introduces trust matrix and conditional trust densities to analyze deep neural networks.
result Trust matrices reveal areas needing improvement for deep neural networks.

Trust is a collective, self-fulfilling phenomenon that suggests analogies with phase transitions. We introduce a stylized model for the build-up and collapse of trust in networks, which generically displays a first order transition. The basic assumption of our model is that whereas trust begets trust, panic also begets…

2014-09-22abs ↗pdf ↗

This paper improves deep learning model consistency through ensemble methods.

problem Consistency and correct-consistency issues in deep learning models.
method Formal definition of consistency and correct-consistency, proving ensemble improvement, proposing dynamic snapshot ensemble method.
result Ensemble methods can improve correct-consistency of deep learning models.

TRUST improves tree models' accuracy while maintaining interpretability.

problem Piecewise-constant regression trees lack in predictive accuracy compared to black-box models.
method Combines Random Forest accuracy with interpretability of shallow trees and sparsity of linear models, using LLMs for explanations.
result TRUST outperforms other interpretable models in predictive accuracy and matches Random Forest's accuracy.

TROLL improves RL for LLMs by replacing clipping with a trust region projection.

problem Clipping in RL for LLMs causes instability and suboptimal performance.
method TROLL uses a discrete differentiable trust region projection to replace clipping, balancing computational cost and effectiveness.
result TROLL consistently outperforms PPO-like clipping in training speed, stability, and final success rates.

Due to the rapid growth of data and computational resources, distributed optimization has become an active research area in recent years. While first-order methods seem to dominate the field, second-order methods are nevertheless attractive as they potentially require fewer communication rounds to converge. However, th…

2018-06-20abs ↗pdf ↗

Decisions by Machine Learning (ML) models have become ubiquitous. Trusting these decisions requires understanding how algorithms take them. Hence interpretability methods for ML are an active focus of research. A central problem in this context is that both the quality of interpretability methods as well as trust in ML…

2019-01-20abs ↗pdf ↗

Bayesian optimization tackles constrained high-dimensional problems with penalties and trust regions.

problem Constrained optimization in high-dimensional black-box settings with expensive evaluations and complex feasibility regions.
method Penalty formulation, surrogate model, trust region strategy, Expected Improvement acquisition function.
result The proposed Trust Region method identifies high-quality feasible solutions with fewer evaluations and maintains stable performance.

Study examines how uncertainty visualization affects analyst trust in automated classification systems.

problem The impact of uncertainty on analyst trust in automated classification systems.
method Empirical study evaluating different active learning query policies and visualizations.
result Query policy significantly influences analyst trust in automated classification systems.

Report on enhancing trust in ML models with visualizations.

problem Understanding and trusting the results of black box ML models.
method Categorization of visualization techniques, statistical overview, topic analyses, and interactive web-based survey.
result Expanded categorization of trust against different facets of interactive ML.

An algorithm is proposed for solving stochastic and finite sum minimization problems. Based on a trust region methodology, the algorithm employs normalized steps, at least as long as the norms of the stochastic gradient estimates are within a specified interval. The complete algorithm---which dynamically chooses whethe…

2017-12-29abs ↗pdf ↗

Trust lies at the crux of most economic transactions, with credit markets being a notable example. Drawing on insights from the literature on coordination games and network growth, we develop a simple model to clarify how trust breaks down in financial systems. We show how the arrival of bad news about a financial agen…

2009-11-16abs ↗pdf ↗

pFedGame uses game theory for decentralized federated learning in dynamic networks.

problem Performance bottlenecks, data bias, model convergence issues, and model poisoning attacks in federated learning.
method pFedGame employs game theory to decentralize federated learning, avoiding a central aggregation server and addressing dynamic network challenges.
result pFedGame achieves higher accuracy (over 70%) in heterogeneous data compared to existing methods.

People who design, use, and are affected by autonomous artificially intelligent agents want to be able to \emph{trust} such agents -- that is, to know that these agents will perform correctly, to understand the reasoning behind their actions, and to know how to use them appropriately. Many techniques have been devised …

2017-11-08abs ↗pdf ↗

Proposes a tuning-free dynamic pricing method for linear valuation models.

problem Dynamic pricing in linear valuation models with unknown market noise distribution.
method Shape-constrained isotonic regression under weaker Hölder continuity assumptions.
result Demonstrates lower empirical regret compared to existing methods.

PRCD-MAP learns to trust imperfect priors in causal discovery, improving accuracy and robustness.

problem Tackles the brittle trade-off between blind trust and rejection of external priors in causal discovery.
method Proposes PRCD-MAP, a soft prior-consumption layer that assigns per-edge trust to imperfect priors and modulates regularization in a MAP objective.
result Enjoys a population-level safety guarantee and outperforms existing methods on real-world causal discovery tasks.

Knowing when a classifier's prediction can be trusted is useful in many applications and critical for safely using AI. While the bulk of the effort in machine learning research has been towards improving classifier performance, understanding when a classifier's predictions should and should not be trusted has received …

2018-05-30abs ↗pdf ↗

Matrix factorization is a key component of collaborative filtering-based recommendation systems because it allows us to complete sparse user-by-item ratings matrices under a low-rank assumption that encodes the belief that similar users give similar ratings and that similar items garner similar ratings. This paradigm h…

2016-04-21abs ↗pdf ↗

Two new algorithms solve nonconvex-strongly concave problems efficiently.

problem Solving nonconvex-strongly concave minimax problems.
method Proposed MINIMAX-TR and MINIMAX-TRACE algorithms.
result Find (ε,ε)(ε, \sqrtε)-second order stationary points within O(ε1.5)\mathcal{O}(ε^{-1.5}) iterations.

Study shows trust and trustworthiness emerge through reinforcement learning.

problem Trust and trustworthiness are universal but not predicted by traditional economic models.
method Used Q-learning algorithm to simulate trust and trustworthiness dynamics in a trust game.
result High levels of trust and trustworthiness emerge when individuals consider both past and future experiences.

Study finds visual explanations do not significantly improve human accuracy or trust in model predictions.

problem Measuring the impact of visual explanations on human accuracy and trust in model predictions.
method Randomized controlled trial with image-based age prediction task, varying levels of explanation quality.
result Visual explanations do not significantly alter human accuracy or trust in the model.

Proposes a new algorithm for solving optimization problems with stochastic objectives and equality constraints.

problem Optimization problems with stochastic objectives and deterministic equality constraints.
method Trust-region stochastic sequential quadratic programming (TR-StoSQP) with adaptive relaxation techniques.
result Established a global almost sure convergence guarantee for TR-StoSQP.

Proximal policy optimization (PPO) is one of the most popular deep reinforcement learning (RL) methods, achieving state-of-the-art performance across a wide range of challenging tasks. However, as a model-free RL method, the success of PPO relies heavily on the effectiveness of its exploratory policy search. In this pa…

2019-01-29abs ↗pdf ↗