New algorithm finds local minima in non-convex problems efficiently.
problem Finding local minima in non-convex finite-sum minimization problems.
method Stochastic Trust Region (STR) algorithm combining inexact gradient and Hessian estimation.
result STR finds ( ε , ε ) (ε, \sqrtε) ( ε , ε ) -approximate local minimum with improved efficiency. 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.
TRSVR combines SVRG with trust-region for faster optimization.
problem Unconstrained nonconvex optimization problems.
method Adaptive stochastic trust-region method with variance reduction.
result Converges to first-order stationary points with SVRG.
Improved sample efficiency in policy gradient methods using SVRG.
problem Excessive variance in policy gradient estimates.
method Applying SVRG to model-free policy gradient methods.
result Significantly better performance on robotic control tasks.
New sampling strategy improves TR algorithms for stochastic optimization.
problem Derivative-free stochastic optimization with Monte Carlo estimates.
method Stratified adaptive sampling to optimize MC sample size.
result Reduced sample complexity and superior efficiency confirmed.
Algorithm improves stochastic gradient optimization with normalized steps.
problem Stochastic and finite sum minimization problems.
method Trust region algorithm with normalized steps.
result Algorithm converges similarly to traditional stochastic gradient under certain conditions.
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.
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.
The paper develops a method to estimate trust weights in social networks using active sensing.
problem Estimating the relative trust agents place on each other in social networks.
method Regression model based on the steady state equation of the linear DeGroot model, using stubborn agents as influencers.
result The network structure can be revealed when a sufficient number of stubborn agents influence ordinary agents.
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.
New algorithm improves deep learning stability with limited data.
problem Stability and robustness in reinforcement learning with scarce data.
method Uncertainty-aware trust region approach to policy optimization.
result Stable policy updates adapt to uncertainty levels during learning.
Two multifidelity trust-region methods use low-fidelity models for efficient optimization.
problem Efficiently solving complex optimization problems with limited data.
method Sketched Trust-Region (STR) and SVD Trust-Region (SVDTR) methods using low-fidelity models.
result Potential gain in efficiency demonstrated through numerical examples.
The estimation of multivariate GARCH time series models is a difficult task mainly due to the significant overparameterization exhibited by the problem and usually referred to as the "curse of dimensionality". For example, in the case of the VEC family, the number of parameters involved in the model grows as a polynomi…
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.
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.
HTRPO tackles sparse rewards in RL with improved stability and performance.
problem Sparse rewards in reinforcement learning.
method HTRPO extends TRPO with hindsight and QKL for better policy update stability.
result HTRPO consistently outperforms TRPO and HPG in various sparse reward tasks.
GIT uses gradient estimators to target interventions for causal discovery.
problem Challenges in inferring causal structure from observational data.
method GIT uses gradient estimators to target interventions for causal discovery.
result GIT performs on par with competitive baselines, surpassing them in low-data regimes.
FD-Net predicts future dynamics from data using Hessian-Free TRCG method.
problem Discovering hidden partial differential equations from data.
method Finite-difference inspired convolutional neural network with Hessian-Free TRCG method.
result FD-Net predicts future dynamics efficiently using few trainable parameters.
Stablecoin system improves resilience to extreme market events.
problem Vulnerability of stablecoins to extreme volatility and adversarial attacks.
method MVF-Composer uses multi-agent simulations to stress-test and down-weight manipulative signals.
result Reduces peak peg deviation by 57% and mean recovery time by 3.1x under adversarial conditions.
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.
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.
DeFi doesn't fully remove trust, showing run risk and personal character's importance.
problem The need for trust in DeFi despite its code-based approach.
method Natural experiment revealing identities of DeFi participants, including a criminal.
result DeFi doesn't fully remove trust, showing run risk and personal character's relevance.
Normalizing flows policy improves trust region policy optimization.
problem Improving exploration and avoiding local optima in policy optimization.
method Constructing trust region with KL divergence constraints and using normalizing flows policy.
result Normalizing flows policy significantly improves policy optimization, especially on high-dimensional tasks.
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…
Survey of assurances for trust in human-autonomy systems.
problem Ensuring trust in human-autonomy systems.
method Survey and review of existing research.
result Refined definition of assurances for trust.
Quantifies interpretability and trust in ML decisions.
problem Measuring the quality and trustworthiness of ML interpretability methods.
method Proposes a quantitative measure based on information transfer rate and empirical validation.
result Empirical evidence shows the proposed metric differentiates interpretability methods and improves productivity.
SPMF improves social recommendation by considering trust and preference domains.
problem Ignoring trust and preference domain differences in social recommendations.
method SPMF uses matrix factorization with trust and preference segmentation.
result SPMF outperforms state-of-the-art recommendation algorithms.
A new trust score improves classifier reliability.
problem Improving classifier reliability in safety-critical applications.
method Proposed a trust score based on classifier agreement with a modified nearest-neighbor classifier.
result Empirically shows high trust scores produce high precision in identifying correctly classified examples.
The paper addresses the difficulty of decision makers trusting AI-assisted predictions and proposes a method to improve confidence values.
problem Decision makers struggle to trust AI-assisted predictions based on confidence values.
method The paper investigates why decision makers have difficulties and proposes a method to construct more useful confidence values.
result Multicalibration with respect to the decision maker's confidence on her own predictions is a sufficient condition for alignment, leading to better decisions.
New method improves Gaussian Mixture Model fitting speed.
problem Slow convergence of EM algorithm for complex data.
method Riemannian Newton Trust-Region method for Gaussian Mixture Models.
result Outperforms existing methods in runtime and iterations.
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.
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.
Proposes a probabilistic model to improve hydrology predictions and trust.
problem Noisy or missing basin characteristics impact streamflow prediction.
method Probabilistic inverse modeling framework to reconstruct basin characteristics.
result 6% improvement in R 2 R^2 R 2 for streamflow prediction, 17% reduction in uncertainty. 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}) O ( ε − 1.5 ) iterations. 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.
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.
Paper tackles robust training with noisy labels using a trusted set and pseudo labels.
problem Training deep neural networks with high label noise.
method Leveraging a small trusted set to estimate exemplar weights and pseudo labels for noisy data.
result Achieves high accuracy on large-scale datasets with real-world label noise.
This research improves uncertainty estimation for medical predictions, enhancing model trust and decision support.
problem Improving model uncertainty estimation for rare medical conditions.
method Developed and refined heuristics for selecting uncertainty estimation techniques, distinguishing them by clinical use-case. Also, compared ensembles vs. auto-encoders for detecting out-of-domain examples.
result Auto-encoders outperform ensembles in detecting out-of-domain examples, highlighting their importance for medical tabular data.
Survey of algorithmic assurances for trust in AI agents.
problem Ensuring trust in AI agents designed for human-autonomy relationships.
method Formal definition and classification of algorithmic assurances, synthesis of research across AI communities.
result Algorithmic assurances fall along a spectrum impacting agent core functionality.
Interactive learning explained to users improves trust and model understanding.
problem Lack of user understanding and trust in interactive learning models.
method Proposes a framework where learners explain interactive queries and predictions to users, using visual explanations.
result Boosts predictive and explanatory powers of and user trust in learned models.
Proposes a trust model for SIoT nodes using Hellinger distance and matrix factorization.
problem Trust management in SIoT to reduce risk from malicious nodes.
method Flexible bipartite graph, Hellinger distance, centrality, similarity measures, matrix factorization.
result The proposed trust prediction mechanism outperforms existing methods in accuracy and resilience.
Improves inference-time alignment for diffusion models without updating weights.
problem Aligning diffusion models without updating weights for high-reward outputs.
method Trust-Region Iterative Twisted Sequential Monte Carlo (TRI-TSMC) for variance reduction and efficiency.
result Improves primary alignment objectives on text generation tasks.
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.
Study identifies key aspects of explainable ML for clinical trust.
problem Lack of concrete definitions for usable explanations in clinical settings.
method Surveyed clinicians from two specialties to understand their needs for explainability.
result Characterized specific aspects of explainability that improve trust in ML models.
Trust-region methods and natural gradients are equivalent in certain policy search scenarios.
problem Improving policy search methods in continuous control tasks.
method Introducing compatible policy search (COPOS) that uses natural parameterization and compatible value function approximation to control entropy loss.
result COPOS yields state-of-the-art results in challenging tasks and reduces entropy loss.