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

202405607809 · Jun 202019922001200920172026
48 results for trusted set

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.

Training set bugs are flaws in the data that adversely affect machine learning. The training set is usually too large for man- ual inspection, but one may have the resources to verify a few trusted items. The set of trusted items may not by itself be adequate for learning, so we propose an algorithm that uses these ite…

2018-01-24abs ↗pdf ↗

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.

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.

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.

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 ↗

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.

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 transparency and model performance metrics increase trust in AutoML systems.

problem Understanding what information influences trust in AutoML systems.
method Three studies: qualitative interviews, controlled experiment, and card-sorting task.
result Transparency and model performance metrics are most important for establishing trust in AutoML systems.

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.

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.

In data-limited settings, stochastic policies can outperform deterministic ones in bandit problems.

problem Making reliable decisions with limited data in bandit problems.
method Designing TRUST, an algorithm that uses localization laws and relative pessimism.
result TRUST achieves comparable sample complexity to LCB on minimax problems but is significantly lower on few-sample problems.

The paper presents a method to compute trusted confidence bounds for LECs in CPS.

problem Non-transparent predictions of LECs make CPS safety challenging.
method Inductive Conformal Prediction (ICP) and Triplet Network architecture.
result Efficient real-time computation of trusted confidence bounds.

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 privacy in federated learning without a trusted server.

problem Privacy in federated learning with silos that distrust each other.
method Introduces Inter-Silo Record-Level Differential Privacy (ISRL-DP) and accelerated algorithms for convex and smooth losses.
result Achieves optimal privacy and accuracy tradeoffs in federated learning.

New method solves optimization problems with stochastic objectives and constraints.

problem Optimization problems with stochastic objectives and deterministic constraints.
method Trust-region interior-point stochastic sequential quadratic programming (TR-IP-SSQP) method.
result Global almost-sure convergence to first-order stationary points under standard assumptions.

Building upon the recent success of deep reinforcement learning methods, we investigate the possibility of on-policy reinforcement learning improvement by reusing the data from several consecutive policies. On-policy methods bring many benefits, such as ability to evaluate each resulting policy. However, they usually d…

2019-01-18abs ↗pdf ↗

Proposes a Quasi-Newton trust region method for policy optimization in reinforcement learning.

problem Lack of stepsize selection criterion and slow convergence in gradient descent for policy optimization.
method Uses a trust region method with Quasi-Newton approximation for the Hessian.
result Demonstrates improved performance and efficiency in continuous control tasks.

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.

New metrics CWSA and CWSA+ improve model evaluation under confidence thresholds.

problem Lack of metrics capturing model reliability under confidence thresholds.
method Introducing CWSA and CWSA+ metrics that reward confident accuracy and penalize overconfident mistakes.
result CWSA and CWSA+ outperform classical metrics in trust-sensitive tests.

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.

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.

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.

TrustNet robustly learns noise patterns from trusted data to improve weakly-supervised classification.

problem Robustness to label noise in weakly-supervised learning.
method TrustNet learns noise patterns from trusted data, then trains a robust classifier using these patterns.
result TrustNet outperforms state-of-the-art methods in robustness to various noise patterns.

Improved conformal prediction for better conditional coverage of classifier predictions.

problem Achieving exact conditional coverage in finite samples for prediction sets.
method Developed a variant of conformal prediction targeting coverage conditional on confidence and trust score.
result Empirically improved conditional coverage properties compared to standard conformal prediction.

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 ↗

Adaptive replication improves stochastic function optimization.

problem Challenges in accurately estimating functions with high variance.
method Trust-region-based Bayesian optimization with adaptive replication.
result Adaptive replication substantially improves solution accuracy and efficiency.

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.

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 ↗

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 ↗

System uses conformal prediction to help experts make accurate decisions without understanding when to trust it.

problem Helping experts make accurate decisions in multiclass classification tasks.
method Develops an automated decision support system using conformal prediction to provide precise prediction sets and an efficient search method.
result System improves expert predictions by providing precise prediction sets and forcing experts to predict from these sets.

TREGO improves EGO for global optimization of high-dimensional problems.

problem Efficient Global Optimization struggles with high dimensions and lacks theoretical guarantees.
method TREGO alternates between EGO steps and local steps within a trust region.
result TREGO outperforms EGO and other methods in black-box optimization problems.

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 ↗

Credit networks represent a way of modeling trust between entities in a network. Nodes in the network print their own currency and trust each other for a certain amount of each other's currency. This allows the network to serve as a decentralized payment infrastructure---arbitrary payments can be routed through the net…

2010-07-03abs ↗pdf ↗