Heterogeneous SVO leads to diverse policies in sequential social dilemmas.
problem Understanding how diverse social value orientations affect behavior in sequential social dilemmas.
method Extending prior reinforcement learning studies, we instantiated heterogeneous SVO in a sequential social dilemma setting and measured task-specific diversity metrics.
result Heterogeneous SVO leads to meaningfully diverse policies across various incentive structures.
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.
Study on how task sequence properties affect continual learning algorithms.
problem Understanding how task sequence properties influence continual learning algorithms.
method Proposes a new procedure using task space modeling and correlation analysis.
result Error rates are correlated to a task sequence's total complexity but not to sequential heterogeneity.
Attributes, such as metadata and profile, carry useful information which in principle can help improve accuracy in recommender systems. However, existing approaches have difficulty in fully leveraging attribute information due to practical challenges such as heterogeneity and sparseness. These approaches also fail to c…
PyHHMM is a Python library for HHMMs with advanced features.
problem Handling heterogeneous observation models and missing data in HMMs.
method Object-oriented Python implementation with advanced features.
result PyHHMM supports a heterogeneous observation model and missing data inference.
VAEM extends VAEs to handle mixed-type data heterogeneity.
problem Heterogeneous data with different types and marginal distributions.
method Two-stage training approach to handle mixed-type data.
result VAEM improves deep generative model performance on diverse tasks.
Develops scalable model for learning velocity fields in complex traffic scenarios.
problem Learning heterogeneous and dynamic velocity fields in complex traffic scenarios.
method Nonparametric Bayesian modeling with hierarchical Dirichlet process and infinite hidden Markov model, Gaussian process prior, and scalable approximate inference.
result Demonstrates effective scalability and applicability to real-world traffic data.
Paper tackles robust decision-making from multiple sites with shared structure.
problem Learning robust sequential decisions from heterogeneous multi-site datasets.
method Group-Robust MDPs with d-rectangular uncertainty sets, feature-wise worst-case aggregation, and cluster-level pooling.
result Proves suboptimality bound for robust planning policy under robust partial coverage assumption.
Adapts LRP for LSTM to explain sequential data.
problem Lack of explainable AI for LSTM models.
method Extends LRP to LSTM, introduces new propagation scheme.
result Delivers faithful explanations for LSTM predictions.
Predict sepsis early from EHR data with aggregated clinical events.
problem Predict sepsis from clinical data in EHR with temporal interactions.
method Aggregates heterogeneous clinical events, captures temporal interactions with LSTM.
result Achieved high utility score (0.321) in PhysioNet/Computing in Cardiology Challenge 2019.
The classification procedure of streaming data usually requires various ad hoc methods or particular heuristic models. We explore a novel non-parametric and systematic approach to analysis of heterogeneous sequential data. We demonstrate an application of this method to classification of the delays in responding to the…
Study identifies and estimates treatment effect heterogeneity within principal stratification subpopulations.
problem Causal inference with intermediate outcomes and treatment effect heterogeneity.
method Proposes a novel doubly cross-fit doubly robust machine learner to efficiently learn conditional principal causal effects under principal ignorability.
result Demonstrates informative patterns of treatment effect heterogeneity within the always-survivor subpopulation in an acute lung injury trial.
MPHD transfers knowledge across different domains for Bayesian optimization.
problem Optimizing functions with unknown or diverse domains.
method MPHD uses neural nets to map domain-specific contexts to GP specifications, enabling transfer learning across heterogeneous search spaces.
result MPHD improves black-box function optimization performance on diverse domains.
Bayesian approach learns causal concepts from diverse social surveys.
problem Inferring causal concepts from heterogeneous data with sparse changes.
method Hierarchical Bayesian model with sequential Monte Carlo sampling.
result Model infers meaningful causal concepts and plausible relations.
The paper develops a method to learn cost-optimal sequential testing policies from retrospective data.
problem Learning cost-optimal sequential decision policies from retrospective data with missing test results.
method Doubly robust Q-learning framework with path-specific inverse probability weights.
result The method reduces testing cost without compromising predictive accuracy.
New strategies improve multi-agent decision-making on irregular networks.
problem Maximizing group reward in multi-agent settings with heterogeneous strategies.
method Design and analysis of heterogeneous explore-exploit strategies for multi-star networks.
result Group performance improves under heterogeneous strategies compared to homogeneous strategies.
Neural Index Policy for multi-action bandits with heterogeneous budgets.
problem Real-world settings often involve multiple interventions with heterogeneous costs and constraints, breaking classical assumptions.
method Introduces a Neural Index Policy (NIP) that learns to assign budget-aware indices to arm-action pairs using a neural network and differentiable knapsack layer.
result Empirically achieves near-optimal performance while strictly enforcing heterogeneous budgets and scaling to hundreds of arms.
AMF-VI uses adaptive mixtures of flows for robust VI across diverse distributions.
problem Inconsistent behavior of single-flow models across different distributions.
method Sequential expert training of individual flows and adaptive global weight estimation via likelihood-driven updates.
result AMF-VI achieves lower negative log-likelihood and stable gains in transport metrics across various posterior families.
This paper proposes a new AED framework for multi-metric experiments with fixed budget.
problem Statistical power challenges in testing multiple metrics simultaneously.
method Two-phase structure: adaptive exploration followed by validation. SHRVar algorithm with relative-variance-based sampling.
result Achieves provable error probability that decreases exponentially.
Subsurface applications including geothermal, geological carbon sequestration, oil and gas, etc., typically involve maximizing either the extraction of energy or the storage of fluids. Characterizing the subsurface is extremely complex due to heterogeneity and anisotropy. Due to this complexity, there are uncertainties…
RNN-HAR model improves VaR forecasting with long-memory and non-linear dynamics.
problem Efficiently forecasting Value at Risk (VaR) with long-memory and non-linear realized volatility.
method Loss-based generalized Bayesian inference with Sequential Monte Carlo for model estimation and prediction.
result RNN-HAR model consistently outperforms other VaR forecasting models.
Paper proposes a new method to handle missing data in medical records using sequential variational autoencoders.
problem Missing data in medical records due to sensor off-times and uneven data collection.
method Sequential variational autoencoders (VAEs) with a new methodology called Shi-VAE.
result Shi-VAE achieves the best performance in terms of both metrics compared to state-of-the-art methods.
New protocol reduces communication costs for heterogeneous bandits over complex networks.
problem Minimizing group regret in a multi-agent, heterogeneous bandit setting over complex networks.
method Flooding with Absorption (FwA) protocol for heterogeneous bandits over complex networks.
result FwA protocol significantly reduces communication costs compared to flooding while maintaining similar regret performance.
C-kNN-LSH identifies similar patient histories for causal inference in longitudinal data.
problem Estimating causal effects from longitudinal trajectories with high-dimensional confounding.
method C-kNN-LSH uses locality-sensitive hashing to find clinical twins and estimate treatment effects.
result C-kNN-LSH outperforms existing methods in capturing recovery heterogeneity and estimating policy values.
New methods optimize experiment selection for sequential data, improving model accuracy.
problem Optimizing experiment selection for sequential data in multidimensional cases.
method Adopting greedy experiment selection methods for maximum likelihood estimation.
result Proposed methods produce consistent and asymptotically normal estimators.
A new method for efficient inference in sequential latent-variable models.
problem Computational challenges in integrating subject-specific random effects.
method Anchored variational inference framework to approximate posterior distributions.
result The method achieves accurate estimation with significant computational gains.
TIMeSynC combines financial service interactions for intent prediction.
problem Aligning and learning from multi-domain, multi-resolution sequences for accurate intent prediction.
method An encoder-decoder transformer model addressing sequence alignment, temporal dynamics, and dynamic/static sequence combination.
result Significant improvement in intent prediction over existing methods.
Extends GP models for sequential data, scalable and robust.
problem Handling sequential input-output observations in multi-task settings.
method Variational inference with sparse approximations and recursive GP priors.
result Tractable continual learning with KL divergences and recursive reconstruction.
Adaptive querying learns user psychometrics with AI personas.
problem Learning user psychometrics within query budgets.
method Persona-induced latent variable model with AI personas and large language model response distributions.
result Persona-based posteriors deliver accurate probabilistic predictions.
New model for personalized online advertising with multi-user interaction.
problem Realistic online advertising scenarios with multiple users interacting simultaneously.
method Introduces Multi-User Contextual Cascading Bandit (MCCB) model and proposes UCBBP and AUCBBP algorithms.
result Proves UCBBP and AUCBBP achieve optimal regret bounds for multi-user context.
This work shows how exploiting gradient alignment can improve distributed and federated learning performance.
problem Misalignment of gradients across clients in distributed and federated learning.
method Utilizing implicit regularization through a novel GradAlign algorithm that induces gradient alignment with large mini-batches.
result Improvements in test accuracies and generalization performance.
Dynamic treatment effects estimated over time using covariate balancing.
problem Estimating treatment effects in panel data with dynamic treatments.
method Dynamic covariate balancing with potential local projections.
result Established inferential guarantees for the proposed method.
New RL method tackles dynamic, heterogeneous data.
problem Temporal non-stationarity and subject heterogeneity in reinforcement learning.
method Alternates between change point detection and cluster identification.
result Improves policy learning by detecting similar dynamics over time and across individuals.
Bayesian approach improves rain field reconstruction using CMLs and DMs.
problem Challenges in accurately reconstructing ground-level rainfall from CML path-integrated measurements.
method Bayesian inverse problem with Diffusion Models as priors.
result Improved performance in rainfall estimation compared to existing methods.
Bridges uplift modeling and sequential decision-making with online budget allocation.
problem Treatment allocation under budget constraints in digital advertising.
method Budget-Constrained Causal Bandits (BCCB) integrates learning, exploration, and budget pacing.
result Data-efficiency crossover: BCCB operates effectively from the first user, 3-5x lower performance variance.
A new model for heterogeneous populations optimizes consumption and investment over short horizons.
problem Optimizing consumption and investment in economies with a heterogeneous population over short time periods.
method Continuous-time general equilibrium framework with Brownian flow on a type space, solving vanishing-horizon problems under relative-income criteria.
result Existence and characterization of short-horizon Duesenberry equilibrium, with sharp asset-pricing implications.
ALMAB-DC optimizes expensive black-box experiments using active learning and distributed computing.
problem Efficiently optimizing expensive, gradient-free objectives in computational statistics and machine learning.
method Combines active learning, multi-armed bandits, and distributed asynchronous computing.
result Achieves lower simple regret and superior performance in various tasks compared to non-ALMAB baselines.
RAPTOR-GEN accelerates digital twin development for biopharmaceuticals.
problem Lack of agility in rapid, on-demand production of biotherapeutics due to bioprocess complexity.
method Bayesian learning framework based on a multi-scale probabilistic knowledge graph (pKG) and stochastic differential equations (SDE).
result RAPTOR-GEN accelerates intelligent digital twin development from sparse and heterogeneous experimental data.
A new model integrates LSTM and copulas for high-dimensional financial data.
problem Modeling high-dimensional dependencies across financial markets.
method Variational LSTM with regular vine copulas.
result Outperforms benchmarks in cross-market portfolio forecasting.
Efficient RL method uses SSL for small labeled data in health outcomes.
problem Lack of precise health outcome data for reinforcement learning.
method Semi-supervised learning approach for Q-learning and value estimation.
result Method efficiently estimates Q-function and value function, robust to mis-specification.
SARL uses predicted asset movements to improve financial portfolio management.
problem Maximizing profits or minimizing risks in financial planning.
method State-Augmented RL framework that incorporates diverse asset information and price movement predictions.
result SARL outperforms existing PM approaches in terms of accumulated profits and risk-adjusted profits.
Proposes methods for online conformal prediction with nested prediction sets across multiple confidence levels.
problem Need for uncertainty quantification with multiple confidence levels in diverse applications.
method Online optimization perspective to enforce nestedness of prediction sets while controlling quantile estimation error.
result Achieves stable coverage across all levels, strictly nested prediction sets, and improved efficiency.
AIHT improves online high-dimensional quantile regression by separating support discovery and refinement.
problem Online high-dimensional quantile regression with structural sparsity.
method Adaptive Iterative Hard Thresholding (AIHT) alternates stochastic updates with adaptive hard-thresholding steps.
result AIHT achieves logarithmic regret for the sliding-window objective in high-dimensional settings.
Adaptive AI delegation framework for dynamic decision authority allocation.
problem Dynamic allocation of decision authority to AI-generated recommendations under evolving evidence quality and uncertainty.
method Formulated as a Governance-Aware POMDP, using Bayesian inference for informational state estimation and sequential optimization for authority allocation.
result Sequential Bayesian governance provides the strongest general-purpose policy across AI-quality regimes, adapting to evolving evidence.
A GPU framework speeds up BnB for discrete optimization problems.
problem Optimizing large-scale discrete problems with GPU limitations.
method Parallel BnB nodes in GPU batches, using padding and custom kernels.
result One to two orders of magnitude speedup and zero optimality gap.
New method tightens federated probe-logit distillation rates under varying bandwidths.
problem Estimating conditional distributions in federated learning with heterogeneous bandwidth constraints.
method Developed a new federated probe-logit distillation (FPLD) method with optimal allocation for varying bandwidths.
result Achieved matching lower and upper bounds for the minimax rate under heterogeneous bandwidths.
The paper proposes a method to learn and leverage contextual preference distributions for better decision-making.
problem Heterogeneous and context-dependent human preferences in decision-making problems.
method A sequential learning-and-optimization pipeline using a bounded-variance score function gradient estimator to train a predictive model mapping contextual features to preference distributions.
result The approach reduces average post-decision surprise by up to 25 times compared to risk-averse baselines in a ridesharing environment.
Adaptive RL optimizes testing resource allocation for dynamic software environments.
problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.