sGBM speeds up gradient boosting by parallelizing and adapting base learners.
problem Infeasibility of parallelizing GBM training and sub-optimal performance in online settings.
method Integrates multiple differentiable base learners, jointly optimizing them with linear speed-up.
result sGBM achieves higher time efficiency and better accuracy than traditional GBM.
Safe RL for autonomous vehicles using PCPO with trust regions and parallel learners.
problem Unexplainable behaviours and lack of safety guarantees in RL for real vehicles.
method PCPO framework with trust regions and parallel learners.
result Safe learning confirmed for autonomous vehicles with fast convergence.
Enhances RL performance with a population-guided parallel learning scheme.
problem Improving off-policy reinforcement learning performance.
method Population-guided parallel learning scheme with shared experience replay buffer and soft policy update.
result Monotone improvement of the expected cumulative return proved theoretically and demonstrated in practice.
The paper introduces a privacy-preserving method for estimating treatment effects that maintains accuracy.
problem Estimating heterogeneous treatment effects in sensitive data while protecting privacy.
method A general meta-algorithm for CATE estimation with differential privacy guarantees, using sample splitting and parallel composition.
result The meta-algorithm maintains accuracy even with differential privacy, showing that most accuracy loss is due to variance increase.
Learning about many things can provide numerous benefits to a reinforcement learning system. For example, learning many auxiliary value functions, in addition to optimizing the environmental reward, appears to improve both exploration and representation learning. The question we tackle in this paper is how to sculpt th…
A scalable method for heavy-tailed data using robust aggregation.
problem Scalability issues with robust gradient descent under heavy-tailed data.
method Robustly choosing a strong candidate from parallel sub-processes.
result Improved scalability with robustness to perturbations.
Online learning algorithms have impressive convergence properties when it comes to risk minimization and convex games on very large problems. However, they are inherently sequential in their design which prevents them from taking advantage of modern multi-core architectures. In this paper we prove that online learning …
Multi-simulator training has contributed to the recent success of Deep Reinforcement Learning by stabilizing learning and allowing for higher training throughputs. We propose Gossip-based Actor-Learner Architectures (GALA) where several actor-learners (such as A2C agents) are organized in a peer-to-peer communication t…
Meta-learner estimates heterogeneous DiD effects robustly.
problem Estimating heterogeneous treatment effects in panel data with DiD.
method Doubly robust meta-learner for CATT, using convex risk minimization and auxiliary models.
result Superior performance over existing methods in empirical tests.
This paper deals with distributed policy optimization in reinforcement learning, which involves a central controller and a group of learners. In particular, two typical settings encountered in several applications are considered: multi-agent reinforcement learning (RL) and parallel RL, where frequent information exchan…
VISTA learns causal structures by integrating local subgraphs, improving accuracy and efficiency.
problem Efficiently learning causal structures from high-dimensional observational data.
method VISTA decomposes the global causal structure learning problem into local subgraphs based on Markov Blankets, integrating them via a weighted voting mechanism.
result VISTA achieves notable improvements in accuracy and efficiency over existing methods.
Study the tradeoffs of bandit feedback in multiclass classification.
problem The price of using bandit feedback in multiclass classification.
method Mistake bound model, analysis of variants, and comparison of learners and adversaries.
result The optimal mistake bound under bandit feedback is at most O(k) times higher than in full information, with a tight bound of O(k). Stochastic gradient descent (SGD) is a well known method for regression and classification tasks. However, it is an inherently sequential algorithm at each step, the processing of the current example depends on the parameters learned from the previous examples. Prior approaches to parallelizing linear learners using SG…
Study online learning with off-policy feedback in adversarial bandit problems.
problem Learning with limited direct feedback in sequential decision making.
method Proposed algorithms that adapt pessimistic reward estimators to handle unknown behavior policy.
result Guaranteed regret bounds scaling with policy mismatch, improving performance against well-covered comparators.
This paper accelerates D-PSGD and AD-PSGD for large-scale deep learning tasks.
problem Decreasing spectral gap with increasing number of learners hampers convergence in D-PSGD and AD-PSGD.
method Improves spectral gap while minimizing communication cost through new techniques.
result Demonstrates faster training times and lower error rates on large-scale tasks.
Big data trend has enforced the data-centric systems to have continuous fast data streams. In recent years, real-time analytics on stream data has formed into a new research field, which aims to answer queries about what-is-happening-now with a negligible delay. The real challenge with real-time stream data processing …
Lambda Learner improves model freshness in data streams.
problem Balancing model freshness and computational costs in data streams.
method Incremental updates in response to mini-batches from data streams.
result Lambda Learner outperforms offline models in time-sensitive updates.
Modern Automatic Speech Recognition (ASR) systems rely on distributed deep learning to for quick training completion. To enable efficient distributed training, it is imperative that the training algorithms can converge with a large mini-batch size. In this work, we discovered that Asynchronous Decentralized Parallel St…
New method uses SHAP for biomarker identification in CATE models.
problem Identifying predictive biomarkers from observational data.
method Surrogate estimation approach using SHAP values for CATE meta-learners.
result SHAP accurately identifies biomarkers in high-dimensional data.
A new concept of confidence in learning is defined and analyzed.
problem Understanding and quantifying trust in learning processes.
method Formal axioms, continuum measures, vector fields, loss functions.
result Confidence can be represented and optimized in learning.
LIFE framework improves model accuracy and interpretability.
problem Achieving high prediction accuracy and interpretability in neural networks.
method Three-step process: subset definition, feature creation, and linear model combination.
result LIFE consistently outperforms other models in prediction accuracy and interpretability.
Improves memory efficiency for meta-learning with large images.
problem High memory usage in meta-learning for few-shot classification.
method LITE: episodic training scheme that decomposes task gradients and back-propagates only a random subset of images.
result Achieves state-of-the-art accuracy on real-world and challenging benchmarks.
Method improves treatment effect prediction robust to unknown covariate shifts.
problem Estimating heterogeneous treatment effects for different populations.
method Post-processing CATE T-learners with multi-accurate predictors to handle unknown covariate shifts.
result Improves bias and mean squared error in simulations with covariate shifts.
Optimal algorithm converts weak to strong learner with less data.
problem Constructing a strong learner from a weak learner with minimal data.
method New algorithm that uses less training data than AdaBoost.
result Optimal sample complexity for converting weak to strong learner.
Inverse reinforcement learning (IRL) enables an agent to learn complex behavior by observing demonstrations from a (near-)optimal policy. The typical assumption is that the learner's goal is to match the teacher's demonstrated behavior. In this paper, we consider the setting where the learner has its own preferences th…
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.
Recent work in distance metric learning has focused on learning transformations of data that best align with specified pairwise similarity and dissimilarity constraints, often supplied by a human observer. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the bette…
New meta-learners estimate time-varying treatment effects without model assumptions.
problem Estimating treatment effects over time in personalized medicine.
method Model-agnostic meta-learners for weighted pseudo-outcome regressions.
result Comprehensive theoretical analysis and practical insights for choosing meta-learners.
Reducing communication in training large-scale machine learning applications on distributed platform is still a big challenge. To address this issue, we propose a distributed hierarchical averaging stochastic gradient descent (Hier-AVG) algorithm with infrequent global reduction by introducing local reduction. As a gen…
Parallel gradient boosting speeds up multi-output regression.
problem Efficiently predicting entire conditional distributions.
method Modification of gradient boosting to use a common descent direction.
result Significantly faster and comparable performance to state-of-the-art boosting libraries.
New survival learners estimate heterogeneous treatment effects from time-to-event data.
problem Estimating HTEs from time-to-event data with censoring outcomes.
method Orthogonal survival learners with theoretical guarantees and custom weighting functions.
result Orthogonal survival learners provide robust and model-agnostic HTE estimation.
Proposes a method to integrate learner models robustly against misspecifications.
problem Misspecifications in learner models and parameter sharing patterns degrade prediction accuracy.
method Sequentially incorporates additional learners based on user-specified parameter sharing patterns.
result Data-adaptively selects the most suitable way of parameter sharing to enhance predictive performance.
This chapter deals with decentralized learning algorithms for in-network processing of graph-valued data. A generic learning problem is formulated and recast into a separable form, which is iteratively minimized using the alternating-direction method of multipliers (ADMM) so as to gain the desired degree of paralleliza…
VTIRT speeds up IRT inference for dynamic learner proficiency.
problem Expensive and slow inference algorithms for dynamic IRT models.
method Variational Temporal IRT (VTIRT) for fast, accurate inference.
result Orders of magnitude speedup in inference runtime with accurate results.
Method selects the best deep learner for time-series prediction using Bayesian networks.
problem Selecting the most effective deep learning model for time-series prediction.
method Bayesian network selects deep learners based on input variables and cluster training data.
result Threshold value determines which deep learners predict time-series data robustly.
One of the most ambitious use cases of computer-assisted learning is to build a recommendation system for lifelong learning. Most recommender algorithms exploit similarities between content and users, overseeing the necessity to leverage sensible learning trajectories for the learner. Lifelong learning thus presents un…
In this paper, we make an important step towards the black-box machine teaching by considering the cross-space machine teaching, where the teacher and the learner use different feature representations and the teacher can not fully observe the learner's model. In such scenario, we study how the teacher is still able to …
pystacked combines machine learning models for improved predictions.
problem Improving machine learning model performance through stacking.
method Stacked generalization using Python's scikit-learn with various base learners.
result Enhanced predictive models through combining multiple machine learning algorithms.
MTL2L learns to adapt optimisation rules for unseen data.
problem Learners need to adapt to unseen data domains.
method Introduces MTL2L, a context-aware neural optimiser.
result MTL2L can adapt optimisation rules for unseen data.
Teaches sequential learners with changing inner states to improve future performance.
problem Teaching sequential learners with evolving inner states.
method Introduces an optimal control approach for multi-agent learning.
result Optimal control approach improves future performance of learners.
Owing to the recent advances in "Big Data" modeling and prediction tasks, variational Bayesian estimation has gained popularity due to their ability to provide exact solutions to approximate posteriors. One key technique for approximate inference is stochastic variational inference (SVI). SVI poses variational inferenc…
Theorem ensures superior learning outcomes for authorized learners with quantum label encoding.
problem Ensuring data security for authorized learners in machine learning.
method Quantum label encoding and PAC learning framework.
result Authorized learners achieve superior learning outcomes while eavesdroppers do not.
Meta-learners improve causal effect estimation in small samples.
problem Estimating causal effects using machine learning methods.
method Sample-splitting and cross-fitting to reduce overfitting bias.
result Meta-learners' performance depends on sample size and estimation procedure.
The paper presents a method for personalized exercise recommendations that improves learner skill gain.
problem Adapting to individual needs in large, diverse groups of learners in digital environments.
method Contextual Thompson Sampling to select exercises that advance learner skill.
result The method recommends exercises associated with greater skill improvement and adapts to learner differences.
Deep reinforcement learning algorithms have been successfully applied to a range of challenging control tasks. However, these methods typically struggle with achieving effective exploration and are extremely sensitive to the choice of hyperparameters. One reason is that most approaches use a noisy version of their oper…
New LT-O-learners improve HLTE estimation with low overlap.
problem Challenges in estimating heterogeneous long-term treatment effects due to limited overlap.
method Introduces LT-O-learners that use custom overlap weights to downweight low-overlap samples.
result LT-O-learners provide robust HLTE estimates with lower variance in low-overlap regimes.
Paper introduces GDR-learners for estimating potential outcomes from observational data.
problem Lack of theoretical property of general Neyman-orthogonality in deep generative models.
method Develops flexible GDR-learners based on various deep generative models.
result GDR-learners possess quasi-oracle efficiency and rate double robustness, asymptotically optimal.
Proposes an autonomous IDS using multiple learning techniques.
problem Autonomous and zero-day attack detection in IDS.
method Parallel use of GRU, CNN, and random forest; majority vote and OR logic combination.
result Achieved high accuracy (87.28%) on NSL-KDD's 'KDDTest+' dataset.