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

98197295393 · Jun 202019922001200920172026
48 results for trust evaluation

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.

A method for trust evaluation of devices in human-device coexistence systems.

problem Efficient trust evaluation of devices in systems with diverse physical and social attributes.
method Canonical correlation analysis-enhanced hypergraph self-supervised learning (HSLCCA).
result The proposed HSLCCA method significantly outperforms baseline algorithms in identifying trusted devices.

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.

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.

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.

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.

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 ↗

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.

AutoAIViz visualizes AutoAI's model generation process, improving user trust.

problem Limited transparency in AutoAI systems leads to lack of user understanding and trust.
method Developed and evaluated AutoAIViz, an experimental system that visualizes AutoAI's model generation process.
result AutoAIViz helps users complete data science tasks and increases their understanding, improving trust in AutoAI systems.

Synthetic experiments are crucial for assessing causal machine learning methods.

problem Current empirical evaluations of causal machine learning methods are insufficient and unreliable.
method Propose principles for conducting rigorous empirical analyses with synthetic data.
result Rigorous synthetic experiments are essential for building trust in causal machine learning methods.

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.

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 ↗

Study investigates how AI can create and detect deceptive explanations, finding they can fool humans but ML can detect them.

problem The risk of deceptive AI explanations increasing trust issues and economic risks.
method Investigates creation and detection of deceptive explanations using AI models and machine learning methods.
result Deceptive explanations can fool humans, but ML can detect them with high accuracy.

Survey reviews explainability in AI for healthcare, emphasizing trust and transparency.

problem Lack of transparency hinders AI adoption in healthcare.
method Comprehensive literature review to guide explainable AI design.
result Quantitative evaluation metrics are needed for some explainability properties.

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.

TES optimizes black-box functions efficiently with minimal approximations.

problem Efficient Bayesian optimization with minimal approximations and generalization to batch BO.
method TES acquisition function measures information gain on trusted maximizers.
result TES achieves state-of-the-art performance with minimal approximations.

KCoreMotif clusters large networks efficiently by exploiting k-core decomposition and motifs.

problem Efficiently clustering large networks for trust evaluation.
method Exploits k-core decomposition and motifs to perform motif-based spectral clustering on k-core subgraphs.
result The proposed algorithm is accurate and efficient for large networks.

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

Reinforcement Learning(RL) with sparse rewards is a major challenge. We propose \emph{Hindsight Trust Region Policy Optimization}(HTRPO), a new RL algorithm that extends the highly successful TRPO algorithm with \emph{hindsight} to tackle the challenge of sparse rewards. Hindsight refers to the algorithm's ability to l…

2019-07-29abs ↗pdf ↗

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.

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.

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.

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.

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 ↗

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.

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.

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 ↗

DarkneTZ protects edge devices from DNN model leaks using TEE and model partitioning.

problem Privacy risks of pre-trained DNNs on edge devices through membership inference attacks.
method Model partitioning into sensitive and untrusted parts, leveraging TEE.
result DarkneTZ provides reliable model privacy with minimal performance overhead.

QUACKIE creates a new benchmark for NLP interpretability.

problem Evaluating NLP interpretability methods is challenging due to biased ground truths.
method Formulated a custom classification task from question-answering datasets, generating unbiased ground truths.
result Demonstrated the effectiveness of current interpretability methods on the new benchmark.

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.

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 finds machine learning interpretations are often unstable and unreliable.

problem Reliability of machine learning interpretations in high-stakes domains.
method Stability study on global interpretations using tabular data.
result Popular interpretation methods are frequently unstable, less stable than predictions, and not associated with prediction accuracy.

Transparency, user trust, and human comprehension are popular ethical motivations for interpretable machine learning. In support of these goals, researchers evaluate model explanation performance using humans and real world applications. This alone presents a challenge in many areas of artificial intelligence. In this …

2017-11-20abs ↗pdf ↗