SCAFFLSA reduces communication complexity for federated learning with heterogeneous clients.
problem Quantifying and reducing communication complexity in federated learning with heterogeneous clients.
method Proposes SCAFFLSA, a variant of FedLSA using control variates to correct for client drift.
result SCAFFLSA achieves logarithmic communication complexity for statistically heterogeneous agents, scaling with the inverse of the desired accuracy.
New framework learns complex AI attitudes from heterogeneous data.
problem Heterogeneous ordinal structure in AI attitudes, poorly captured by existing methods.
method Monotone Gaussian score embedding, BNP complexity discovery, confirmatory fixed-K estimation.
result Reduced holdout MSE by 25.8% over single-graph baseline.
Ringleader ASGD optimizes SGD for diverse edge devices with varying data and computation speeds.
problem Scalable distributed optimization with heterogeneous devices and data.
method Ringleader ASGD, an asynchronous SGD algorithm.
result Achieves optimal time complexity under data heterogeneity and arbitrary computation speeds.
This research tackles sample complexity in causal graph recovery with temporal heterogeneity.
problem Recovering a unique causal graph from observational data with temporal heterogeneity.
method Integrates time-series dynamics and multi-environment heterogeneity to constrain the problem, enabling a rigorous analysis of statistical limits.
result Unified necessary identifiability conditions and explicit information-theoretic bounds quantify the sample complexity under different noise distributions.
Method for understanding heterogeneous treatment effects in complex causal graphs.
problem Heterogeneity and comorbidity in healthcare problems.
method Developed a new approach to characterize heterogeneous causal effects (HCEs) in graphical contexts, including heterogeneous causal graphs (HCGs) with confounders and mediators.
result Established theoretical forms and properties of HCEs in linear and nonlinear models, and developed interactive structural learning for estimation.
UNTIE learns representations of coupled categorical data.
problem Challenges in learning from unlabeled categorical data with complex couplings.
method UNTIE approach for unsupervised representation learning of heterogeneous couplings.
result UNTIE significantly improves categorical data representations on 25 diverse datasets.
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. Improved time complexity for parallel stochastic optimization in heterogeneous systems.
problem Time complexity in parallel stochastic optimization for large-scale machine learning models.
method Proposes Rennala MVR, a variance-reduced extension of Rennala SGD based on momentum-based variance reduction.
result Variance reduction improves time complexity in relevant parameter regimes for parallel stochastic optimization in heterogeneous systems.
MNIST-NET10 fusion improves MNIST classification to 0.1% error rate.
problem Improving MNIST classification accuracy.
method Complex heterogeneous fusion architecture using degree of certainty aggregation.
result MNIST-NET10 achieves 0.1% error rate with 10 misclassifications.
Federated Q-learning achieves linear speedup with heterogeneity, improving sample complexity.
problem Collaborative learning in distributed RL settings with limited data sharing.
method Analyzes synchronous and asynchronous federated Q-learning, proposes importance averaging.
result Achieves linear speedup with heterogeneity, robust to local trajectory heterogeneity.
Paper tackles end-to-end training of complex neural networks using DIP method.
problem Training complex heterogeneous neural network models end-to-end.
method Deep Innovation Protection (DIP) method using multiobjective optimization.
result End-to-end training of complex heterogeneous neural network models is possible.
HeteroFL trains diverse clients with varying capabilities efficiently.
problem Training models on clients with different computational and communication capacities.
method Proposes HeteroFL framework to adaptively distribute subnetworks based on client capabilities.
result Adaptive subnetwork distribution leads to efficient computation and communication.
Ringmaster ASGD improves Asynchronous SGD's efficiency under varying worker times.
problem Suboptimal performance of Asynchronous SGD under heterogeneous worker computation times.
method Ringmaster ASGD, a novel Asynchronous SGD method with optimal time complexity.
result Ringmaster ASGD achieves optimal time complexity under arbitrary worker heterogeneity.
New method uncovers complex data patterns without losing interpretability.
problem Complex heterogeneities in data not captured by traditional regression.
method Method of Direct Estimation and Inference (MDEI) using machine learning.
result Returns appropriate uncertainty estimates and interpretable results.
Bayesian framework for model uncertainty identifies complex heterogeneity without strong assumptions.
problem Identifying complex heterogeneity in factorial data with varying covariates.
method Rashomon Partition Sets (RPS) using l0 prior for robust model uncertainty.
result RPS provides a robust set of models capturing complex heterogeneity without strong assumptions.
CRL approach improves understanding of heterogeneous treatment effects in complex diseases.
problem Estimating heterogeneous treatment effects in complex diseases.
method Causal rule learning (CRL) workflow consisting of rule discovery, selection, and analysis.
result CRL outperforms other methods in providing interpretable estimates of HTE.
A new tensor model captures complex structures in heterogeneous data.
problem Complex joint and discriminative structures in heterogeneous datasets.
method Double core tensor factorization with smoothing loss functions and linearized ADMM.
result The model accurately estimates factors even with missing entries.
Method completes mixed matrix from complex surveys with heterogeneous missingness.
problem Recovering a mixed dataframe matrix from complex survey sampling with different missingness patterns.
method Two-stage procedure: logistic regression for missingness modeling, and weighted log-likelihood maximization with low-rank constraint.
result The proposed method achieves sublinear convergence and shows superior performance compared to existing methods.
This paper studies generalization in machine learning with mixture data.
problem Generalization performance and statistical rates in heterogeneous data.
method Characterization of heterogeneity via pairwise total variation distance, analysis of Rademacher and Gaussian complexities.
result The requirement on heterogeneity increases as function classes get more complex.
Game-theoretic model captures investor interactions for stock price forecasting.
problem Complex market dynamics driving stock price movements.
method Game-theoretic modeling of heterogeneous investor interactions in a dynamic graph structure.
result Our method outperforms state-of-the-art stock price forecasting methods.
Freya PAGE optimizes nonconvex optimization with heterogeneous, asynchronous workers.
problem Optimizing nonconvex finite-sum problems with varying worker processing times.
method Freya PAGE, a parallel method robust to stragglers and adaptive to slow computations.
result Freya PAGE offers improved time complexity guarantees compared to previous methods.
An unregularized score improves anomaly detection in images with varying complexity.
problem Inaccurate anomaly detection in images with complex shapes and small anomalies.
method Proposed an unregularized score for deep generative models to overcome the issue of lower likelihoods for complex objects.
result The unregularized score is robust to the complexity of samples and improves anomaly detection.
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.
Local GD proves effective for heterogeneous data in federated learning.
problem Minimizing functions from private, heterogeneous data in federated learning.
method Local gradient descent for smooth, convex functions.
result Communication complexity similar to gradient descent in low accuracy regime.
A new method clusters heterogeneous subgroups for accurate causal learning.
problem Diverse causal relationships across different time spans, regions, or strategies.
method Nonlinear Causal Kernel Clustering
result Reduction in prediction error through enhanced causal learning.
FedGLOMO accelerates FL convergence for non-convex functions.
problem Efficiently solving non-convex optimization problems in federated learning with client heterogeneity.
method Combines global and local momentum updates to reduce variance and improve convergence rate.
result Achieves O(ε−1.5) convergence to ε-stationary point, compared to O(ε−2). KHGRec tackles noisy and incomplete KG-enhanced recommendations by modeling complex interactions.
problem Challenges in integrating KGs for accurate recommendations, especially in complex higher-order interactions and heterogeneous modalities.
method KHGRec uses a collaborative knowledge heterogeneous hypergraph (CKHG) to model group-wise interdependencies, employing two hypergraph encoders and attention mechanisms.
result KHGRec achieves an average 5.18% relative improvement over state-of-the-art baselines on four real-world datasets.
MTHetGNN models complex relations in multivariate time series forecasting.
problem Complex relations among variables in multivariate time series forecasting.
method Designs a relation embedding module and a temporal embedding module, using graph neural networks and CNNs.
result Achieves state-of-the-art results in multivariate time series forecasting.
The thesis clarifies when local updates outperform centralized methods in heterogeneous data environments.
problem Understanding when local updates are more effective than centralized or mini-batch methods in distributed optimization.
method Fine-grained consensus-error-based analysis framework, focusing on bounded second-order heterogeneity and third-order smoothness.
result Local updates outperform centralized or mini-batch methods under realistic models of data heterogeneity.
HGP tackles noisy connections and heterogeneity in social graphs for better social recommendation.
problem Challenges in social graphs, especially noisy connections and heterogeneity, hinder GNN-based social recommendation.
method HGP uses a tripartite graph to reduce complexity, personalized PageRank for node embeddings, and attention mechanism for integration.
result HGP outperforms baselines in AUC and F1-score metrics on a large-scale dataset.
DyHATR learns dynamic heterogeneous networks for better link prediction.
problem Learning effective representations of dynamic heterogeneous networks for link prediction.
method Hierarchical attention for heterogeneous information and temporal RNN for evolutionary patterns.
result DyHATR significantly outperforms state-of-the-art baselines on link prediction tasks.
Paper proposes HI-VAE for handling incomplete heterogeneous data.
problem Handling incomplete and heterogeneous data using VAEs.
method Proposes HI-VAE framework for fitting real-valued, positive real valued, interval, categorical, ordinal and count data.
result HI-VAE outperforms supervised models trained on incomplete data.
FedSARSA converges with heterogeneous agents, achieving linear speed-up.
problem Convergence analysis of Federated SARSA with heterogeneous agents.
method Linear function approximation, local training, multi-step error expansion.
result FedSARSA achieves linear speed-up with respect to the number of agents.
Bayesian approach groups observations with similar effects for better inference.
problem Estimating heterogeneity across observations in political science.
method Structured sparsity framework integrated into Bayesian regression analysis.
result Method outperforms state-of-the-art methods for heterogeneous effects estimation.
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.
Generative model captures complex dependence in financial data.
problem Complex dependence structure in business and financial data.
method Multivariate generative model with heterogeneous and asymmetric tail dependence.
result Novel moment learning algorithm for scalable parameter estimation.
A federated minimax framework for heterogeneous clients.
problem Training with edge devices having different datasets and capabilities.
method Proposes a federated minimax optimization framework with normalized updates.
result Improves convergence and communication complexity for nonconvex functions.
Proposes a flexible deep learning model for complex distributions.
problem Complex shapes, strong skews, and multiple modes in output variable distributions.
method Uncountable Mixture of Asymmetric Laplacians (UMAL) deep learning framework.
result UMAL can estimate heterogeneous distributions without strong assumptions.
Method estimates heterogeneous causal effects on networks using orthogonal learning.
problem Challenges in estimating causal effects on networks due to treatment effects on both treated and neighbors, and network homophily.
method Two-stage orthogonal learning framework: first stage uses graph neural networks for nuisance components, second stage residualizes and interpretable attention-based model for causal effects.
result Improves heterogeneous effect estimation and supports interpretable analyses.
Unified MTL framework for heterogeneous data integrates shared and task-specific encoders.
problem Efficiently sharing information across multiple tasks with heterogeneous data.
method Dual-encoder framework with task-shared and task-specific encoders.
result Unified algorithm alternates learning task-specific and shared encoders and coefficients.
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.
Paper tackles event classification for multi-variate time series data with heterogeneous variables.
problem Complex temporal dependencies and sparsity in multi-variate time series data.
method Proposes and compares three representation learning algorithms over symbolized sequences trained jointly with the rest of the network architecture.
result Demonstrates the effectiveness of the proposed approaches on three real-world datasets.
New algorithm improves understanding of decentralized SBO transient iteration complexity.
problem Limited understanding of how network topology, data heterogeneity, and nested structures affect SBO.
method D-SOBA framework with two variants: D-SOBA-SO and D-SOBA-FO, providing non-asymptotic convergence analysis and transient iteration complexity.
result First theoretical understanding of how network topology, data heterogeneity, and nested structures influence decentralized SBO.
CCs learn high-dimensional distributions from heterogeneous data.
problem Learning high-dimensional distributions from heterogeneous data.
method Introducing characteristic circuits (CCs) that learn from data and use spectral domain.
result CCs outperform state-of-the-art density estimators on common benchmark data sets.
Study on evolving interfaces with complex curvature and density effects.
problem Understanding the dynamics of evolving heterogeneous elastic interfaces.
method Modeling an evolving curve with a density function, analyzing the associated gradient flow evolution.
result Analysis of the preservation and asymptotic behavior of geometric properties in the evolving system.
Graph attention networks improve performance on heterogeneous graphs.
problem Complex performance of GNNs on heterogeneous graphs.
method Integrating positional encodings into graph attention networks.
result Graph attention networks excel in node classification and link prediction.
Study shows neural ODEs generalize well on synthetic graphs but struggle with degree heterogeneity and clustering.
problem Understanding neural ODEs on complex networks, especially with varying graph sizes and structures.
method Synthetic data from five dynamical systems on graphs, using Barabási-Barzel form vector fields.
result Degree heterogeneity and dynamical system type are primary factors affecting neural ODEs' generalization.
Proposes BGNN for tumor heterogeneity prediction using graph neural networks.
problem Tumor classification limitations and heterogeneity assessment challenges.
method Artificial data generation, tumor heterogeneity estimation, and BGNN model development.
result BGNN achieves 89.67% accuracy in predicting tumor heterogeneity.