This work advances collaborative decision making by combining human and AI strengths in uncertainty quantification.
problem Current AI lacks robust decision-making capabilities under uncertainty, especially in high-stakes contexts.
method Introduces Human AI Collaborative Uncertainty Quantification (HACUQ) framework, formalizing AI-human collaboration and developing calibration algorithms.
result Optimal collaborative prediction sets follow a two-threshold structure, and online adaptation algorithms can adapt to evolving human behavior.
Enhances financial analysis with multi-agent collaboration.
problem Limited use of AI-agent collaboration in financial research.
method Proposes a multi-agent system for financial investment research.
result Multi-agent system outperforms single-agent models.
We address challenges in collaborative black-box optimization through three frameworks.
problem Challenges in distributed experimentation, heterogeneity, and privacy in black-box optimization.
method Three unifying frameworks: global, local, and predictive.
result Shift from descriptive/predictive to prescriptive federated learning in black-box optimization.
A new algorithm reduces communication costs for collaborative decision-making across clients.
problem Collaborative decision-making with sparse rewards and heterogeneous contexts.
method Federated Lasso algorithm for sparse linear contextual bandits.
result Achieves near-optimal regret with logarithmic communication costs.
New method learns decisions from collective preferences without individual covariates.
problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.
Paper tackles unobserved confounding in human-AI collaborations.
problem Unobserved confounding undermines human-AI collaboration effectiveness.
method Combines sensitivity analysis from causal inference with AI-driven statistical modeling.
result Enhances robustness and reliability of collaborative outcomes.
Develops NFCF to reduce gender bias in social media recommendation systems.
problem Reduces gender bias in collaborative filtering systems on social media data.
method Pre-training and fine-tuning neural collaborative filtering with bias correction techniques.
result Achieves better performance and fairness in gender de-biased recommendations.
AutoML enhances credit decisions with XAI for better transparency.
problem Transparency in AI-driven financial decisions.
method Combining AutoML and XAI (SHAP) for credit scoring.
result Improved efficiency and accuracy in credit decisions with enhanced transparency.
Partner-aware algorithms improve AI collaboration in multi-agent settings.
problem Improving AI cooperation in teams with shared rewards.
method Proposed Partner-Aware strategy extending Upper Confidence Bound for decentralized MAB.
result Achieves logarithmic regret in collaborative decision-making.
Bayesian principles improve agentic AI decision-making.
problem Decision-making under uncertainty in agentic AI systems.
method Bayesian decision theory applied to the orchestration layer of agentic AI.
result Bayesian principles enhance agentic AI's ability to make decisions under uncertainty.
New algorithm reduces regret in collaborative multi-agent bandit problems.
problem Optimizing decisions in a network of agents with communication delays.
method Follow-the-Regularized-Leader (FTRL) algorithm with suitable regularizers and communication protocols.
result Upper bound on individual regret matches lower bound up to a constant factor.
This thesis tackles bias in AI decision-making in banking.
problem Bias in AI-driven banking decisions.
method Understanding, mitigating, and accounting for bias in AI systems.
result Establishment of Responsible AI practices for fair decision-making.
Framework uses human judgment to distinguish algorithmically indistinguishable cases.
problem Clarifying human-AI collaboration in prediction and decision tasks.
method Integrates human judgment to distinguish algorithmically indistinguishable cases.
result Improves performance of any feasible algorithmic predictor.
AdaDKRR tackles data silos by combining autonomy, privacy, and collaboration.
problem Data silos caused by privacy and interoperability constraints.
method Adaptive distributed kernel ridge regression (AdaDKRR) with autonomy, privacy, and collaboration.
result AdaDKRR performs similarly to optimal learning algorithms on the whole data under mild conditions.
A novel method for efficient CDRL over wireless networks.
problem Challenges in collaborative deep reinforcement learning over wireless networks.
method Semantic-aware heterogeneous federated deep reinforcement learning (HFDRL) algorithm.
result Superior performance compared to state-of-the-art baselines.
Experiment shows cognitive biases impact human-AI collaboration, highlighting the need for diverse evaluator samples.
problem Cognitive biases affect human-AI collaboration, leading to suboptimal outcomes.
method Randomized experiment with 2,784 participants, manipulating AI suggestion quality, task burden, and financial incentives.
result Individual attitudes toward AI are the strongest predictor of performance, influencing accuracy and overcorrection.
New algorithms tackle statistical heterogeneity in federated learning.
problem Statistical heterogeneity in distributed machine learning models.
method Introduces three novel methods: SuPerFed, AAggFF, and FedEvg.
result Mitigates statistical heterogeneity in federated learning.
Optimal allocation of human effort to correct AI assessments in decision-making.
problem How to allocate costly human effort to correct noisy or biased AI-generated assessments.
method Decision-theoretic framework treating AI assessments as signals and human judgments as costly information. Developed estimation procedures under nonparametric and linear models.
result Our approach substantially outperforms LLM-only predictions and achieves performance comparable to full human review while using only 20-30% of the human information.
ARCO-BO optimizes multi-agent design under heterogeneity, improving efficiency and performance.
problem Heterogeneous multi-agent optimization challenges in resource use and information sharing.
method ARCO-BO integrates a consensus mechanism, budget-aware sampling, and partial input sharing for heterogeneous design spaces.
result ARCO-BO outperforms independent and collaborative BO methods in complex multi-agent settings.
A new method for estimating uncertainty intervals in regression.
problem Lack of effective methods to estimate uncertainty intervals in regression.
method Collaborating Networks (CN) approach using two neural networks with distinct loss functions.
result CN method improves performance on various real-world datasets, including forecasting A1c values in diabetic patients.
Proposes a new machine learning problem for automated temporal decision-making.
problem Automating human involvement in temporal decision-making processes.
method Develops a deep Bayesian neural network, ForeClassNet, with Boltzmann convolutions.
result Achieves superior performance in real-world Foreclassing datasets.
FST.ai 2.0 improves Taekwondo decision-making with AI, reducing review time and increasing trust.
problem Fair, transparent, and explainable decision-making in Taekwondo.
method Pose-based action recognition, epistemic uncertainty modeling, interactive dashboards.
result 85% reduction in decision review time, 93% referee trust in AI-assisted decisions.
Statisticians contribute to LLMs for better trust and transparency.
problem Emerging statistical challenges in LLMs.
method Exploring statistical contributions to LLMs.
result Statisticians can enhance LLMs' trustworthiness and transparency.
New algorithm reduces complexity in multi-agent reinforcement learning.
problem High computational complexity in exact computations for multi-agent reinforcement learning.
method Design of a scalable algorithm based on Natural Policy Gradient, using local information and limited communication.
result Converges to globally optimal policy with dimension-free complexity and localization error.
SBO uses dual voting to build consensus in noisy feedback settings.
problem Collective decision-making under social influence.
method Dual voting system with noisy public votes and private interviews.
result Efficient consensus-building through noisy public votes, debiased by estimated social graph.
Unified RL survey for healthcare AI interventions.
problem Limited real-life application of RL in healthcare.
method Unified technical survey and case studies.
result Bridge between dynamic treatment regimes and mobile health.
New algorithms reduce communication costs in collaborative learning.
problem Reducing communication costs in collaborative learning.
method Distributed boosting and adaptation to classification noise.
result Communication-efficient algorithms for collaborative PAC learning robust to noise.
CCN estimates full potential outcome distributions without restrictive assumptions.
problem Estimating CATE is insufficient; full potential outcome distributions provide greater insights.
method Collaborating Causal Networks (CCN) learns full potential outcome distributions without restrictive assumptions.
result CCN learns distributions that asymptotically capture true potential outcome distributions.
Supply Chain Management often requires independent organizations to work together to achieve shared objectives. This collaboration is necessary when coordinated actions benefit the group more than the uncoordinated efforts of individual firms. Despite the commonly reported benefits that can be gained in close relations…
Clinical decision making is challenging because of pathological complexity, as well as large amounts of heterogeneous data generated as part of routine clinical care. In recent years, machine learning tools have been developed to aid this process. Intensive care unit (ICU) admissions represent the most data dense and t…
This paper considers the problem of high dimensional signal detection in a large distributed network whose nodes can collaborate with their one-hop neighboring nodes (spatial collaboration). We assume that only a small subset of nodes communicate with the Fusion Center (FC). We design optimal collaboration strategies w…
The excellent performance of representation learning of autoencoders have attracted considerable interest in various applications. However, the structure and multi-local collaborative relationships of unlabeled data are ignored in their encoding procedure that limits the capability of feature extraction. This paper pre…
Firms' collaboration networks can decline but remain resilient.
problem Resilience of firms' collaboration networks during decline.
method Analysis of 21,500 R&D collaborations over 25 years, simulating drop-out cascades.
result Firms' collaboration networks can adapt to mitigate decline and recover.
Robotic systems are ever more capable of automation and fulfilment of complex tasks, particularly with reliance on recent advances in intelligent systems, deep learning and artificial intelligence. However, as robots and humans come closer in their interactions, the matter of interpretability, or explainability of robo…
Study collaborative learning among multi-agents in multi-armed bandits.
problem Minimizing group cumulative regret in a heterogeneous multi-agent setting.
method Developed decentralized algorithms for collaboration between N agents learning M stochastic multi-armed bandits. result Proved near-optimal behavior of proposed algorithms for group regret.
MARLA uses deep reinforcement learning for multi-agent AHT, reducing Bayes risk.
problem Decentralized active hypothesis testing among multiple agents.
method MARLA algorithm using deep multi-agent reinforcement learning.
result MARLA outperforms single-agent learning in AHT problems.
DEMVC improves multi-view clustering with collaborative training and deep autoencoders.
problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.
Survey combines FL and control for better adaptability and privacy.
problem Combining FL and control for better adaptability and privacy.
method Combining Federated Learning (FL) and control methods.
result Combining FL and control enhances adaptability, scalability, generalization, and privacy.
Advances in collaborative filtering and ranking methods.
problem Improving recommendation systems efficiency and accuracy.
method Graph information encoding, pairwise and listwise approaches, regularization techniques, personalization.
result New methods significantly improve recommendation system performance.
PCL tackles collaborative learning for diverse agents, reducing sample complexity.
problem Balancing collaborative speedup with personalization for heterogeneous agents.
method AffPCL, with bias and importance correction mechanisms.
result AffPCL reduces sample complexity by a factor of max{n−1,δ}, where n is the number of agents and δ∈[0,1] measures heterogeneity. In this paper we examine the effect of applying ensemble learning to the performance of collaborative filtering methods. We present several systematic approaches for generating an ensemble of collaborative filtering models based on a single collaborative filtering algorithm (single-model or homogeneous ensemble). We pr…
Collaborative recommendation is an information-filtering technique that attempts to present information items (movies, music, books, news, images, Web pages, etc.) that are likely of interest to the Internet user. Traditionally, collaborative systems deal with situations with two types of variables, users and items. In…
Collaborative filtering (CF) has been successfully employed by many modern recommender systems. Conventional CF-based methods use the user-item interaction data as the sole information source to recommend items to users. However, CF-based methods are known for suffering from cold start problems and data sparsity proble…
The way developers collaborate inside and particularly across teams often escapes management's attention, despite a formal organization with designated teams being defined. Observability of the actual, organically formed engineering structure provides decision makers invaluable additional tools to manage their talent p…
Meta clustering categorizes learners for collaborative learning.
problem Filtering out unqualified collaborators in collaborative learning.
method Select-Exchange-Cluster (SEC) method to classify learners by their supervised functions.
result SEC can cluster learners into accurate collaboration sets and enhance single-learner performance.
Optimal algorithm found for collaborative learning in bandits with optimal regret bounds.
problem Minimizing regret in collaborative multi-agent bandit problems.
method Proposed an algorithm with optimal regret bounds for collaborative multi-agent multi-armed bandit model.
result First algorithm with order optimal regret bounds for collaborative bandit model.
A new privacy-preserving deep learning scheme for asymmetrically collaborative machine learning.
problem Privacy and efficiency in collaborative machine learning across different data owners.
method Decomposes neural network steps for privacy-preserving training; novel protocol for information leakage.
result Efficient training with stable performance and significant speedup.
Today, the prominence of data science within organizations has given rise to teams of data science workers collaborating on extracting insights from data, as opposed to individual data scientists working alone. However, we still lack a deep understanding of how data science workers collaborate in practice. In this work…