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.
Predict social trust using 1-bit measurements and non-uniform sampling.
problem Predict social trust in social networks with sign measurements and non-uniform sampling.
method Propose a 1-bit max-norm constrained formulation and use a projected gradient decent algorithm.
result Demonstrated superior performance on benchmark datasets.
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.
New algorithm for federated learning without a central server.
problem Federated learning in unidirectional trust social networks.
method Central Server Free Federated Learning (OPS) method.
result Users can benefit from communication with trusted users in federated learning.
A deep learning strategy improves recommendation accuracy by leveraging trust and distrust relationships.
problem Data scarcity and cold-start problem in recommender systems.
method Social deep pairwise learning with a ranking loss function and social negative sampling.
result The proposed model achieves an 11.49% improvement over state-of-the-art methods.
Crowdsourcing improves mobile sensing through social network trust.
problem Improving mobile sensing performance using agent-participatory data.
method Introducing crowdsourcing methods inspired by social networks.
result Improved mobile sensing performance via crowdsourcing.
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.
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.
Modeling trading interactions with money and trust variables.
problem Understanding wealth distribution in social networks.
method Simple dynamical model with conserved money and goods, influenced by trust and price.
result Model accurately predicts wealth distribution in trading networks.
Unified model for evolving user and item preferences with social influence.
problem Understanding and inferring evolving user preferences and item ratings.
method Dynamic matrix factorization with social influence, combining opinion dynamics and trust-based recommendation.
result Consistent reduction in root mean squared error by considering both user and item dynamics.
Blockchain aims to improve trust in AI systems, but lacks systematic studies.
problem Lack of systematic studies on blockchain design principles for AI trust.
method Hybrid qualitative and quantitative studies.
result Vast opportunities for future research and practice in blockchain design.
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.
Deep learning ensemble detects social media rumors faster.
problem Timely detection of rumors on social media platforms.
method Ensemble model using deep neural networks and time-series tweet data.
result Improved rumor detection performance by 7.9%.
Transfer learning improves understanding of users on new Web platforms.
problem Lack of knowledge about novel phenomena on new Web platforms due to data sparsity.
method TraNet, a transfer learning-based approach, adapts knowledge from one domain to another.
result TraNet outperforms other approaches in transferring knowledge about users across different Web platforms.
The paper predicts TSE stocks using social media sentiment and volume.
problem Predicting Tehran Stock Exchange (TSE) variables using social media data.
method Hybrid sentiment analysis combining lexicon-based and learning-based methods; built a sentiment lexicon for Persian language.
result Sentiment and volume of online comments are useful for predicting TSE stocks.
New approach simulates reputation dynamics using information compression.
problem Malicious communication strategies in reputation networks.
method Uses information compression techniques to simulate social phenomena.
result Emergent phenomena like echo chambers and deception are observed.
Reciprocating interactions represent a central feature of all human exchanges. They have been the target of various recent experiments, with healthy participants and psychiatric populations engaging as dyads in multi-round exchanges such as a repeated trust task. Behaviour in such exchanges involves complexities relate…
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.
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.
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.
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.
Study uses machine learning to analyze Twitter sentiments about COVID-19.
problem Examining public concerns and sentiments about COVID-19 from Twitter.
method Machine learning (Latent Dirichlet Allocation) to identify topics and sentiments.
result Identified 13 topics and categorized into five themes, revealing dominant fears and mixed feelings.
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.
Measures faithfulness of LLM explanations to reveal hidden biases and misleading claims.
problem LLM explanations can misrepresent the model's reasoning process, leading to over-trust and misuse.
method Defines faithfulness in terms of concept influence and uses counterfactuals and Bayesian models to estimate it.
result Can quantify and discover interpretable patterns of unfaithfulness in LLM explanations.
Proposes a game-theoretic framework for ML trust regulation.
problem Lack of coordination between ML model builders and regulators.
method Formulates trustworthy ML as a multi-objective multi-agent optimization problem and introduces regulation games and ParetoPlay.
result Enables efficient enforcement of ML model specifications without discouraging participation.
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.
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.
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.
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.
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.
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.
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. 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.
Trust-region method improves stochastic variational inference for streaming data.
problem Local optima in stochastic variational inference make posterior approximation quality sensitive to hyperparameters and initialization.
method Replaces natural gradient step with trust-region update for variational inference.
result Trust-region method leads to better results and reduced sensitivity to hyperparameters.
Paper tackles biases in AI embeddings from wild data.
problem Biases in AI embeddings from uncontrolled data.
method Measures biases using social psychology word lists, observes gender bias in occupations, demonstrates simple projection to reduce bias.
result Simple projection significantly reduces embedding biases.
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.
Model investigates how assets, leverage, and trust impact economic growth and confidence.
problem Investigates the role of credit in economic growth and confidence.
method Proposes a macroeconomic model based on assets, leverage, and trust.
result Trust increases when above leverage, leading to higher long-term returns on assets.
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 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.
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.
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.