Generative multitask learning mitigates confounders causing targets.
problem Unobserved confounders causing targets but not inputs.
method Generative multitask learning (GMTL) modifies inference objective to remove joint target influence.
result Improved robustness to target shift across multitask learning methods.
Study examines the impact of target data in transfer learning.
problem Understanding the value of target data in transfer learning.
method Established minimax-rates for source and target sample sizes, introduced transfer exponents.
result Performance limits in transfer learning are captured by transfer exponents.
CNT leverages noisy targets to guide model learning.
problem Learning from noisy or incomplete labels.
method Conditioning model on noisy targets at inference time.
result Model focuses on simpler sub-problems and learns from easier examples first.
This research improves online learning by correcting for target shift in machine learning.
problem Online learning struggles with distributional shift, especially in target values.
method Derives closed-form expressions for online and offline learning, and target correction.
result Online kernel-based learning can learn the same predictor as offline learning with target correction.
With the increasing variety of services that e-commerce platforms provide, criteria for evaluating their success become also increasingly multi-targeting. This work introduces a multi-target optimization framework with Bayesian modeling of the target events, called Deep Bayesian Multi-Target Learning (DBMTL). In this f…
Policy-gradient method controls multiple non-cohesive targets.
problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.
The use of target networks has been a popular and key component of recent deep Q-learning algorithms for reinforcement learning, yet little is known from the theory side. In this work, we introduce a new family of target-based temporal difference (TD) learning algorithms and provide theoretical analysis on their conver…
Data-target pairing is an important step towards multi-target localization for the intelligent operation of unmanned systems. Target localization plays a crucial role in numerous applications, such as search, and rescue missions, traffic management and surveillance. The objective of this paper is to present an innovati…
This work analyzes how often to update the target network in Q-learning.
problem Understanding the optimal frequency of target network updates in Q-learning.
method Formulated target updates as a nested optimization scheme, derived finite-time convergence analysis.
result Optimal target update frequency increases geometrically over time.
(Unsupervised) Domain Adaptation (DA) seeks for classifying target instances when solely provided with source labeled and target unlabeled examples for training. Learning domain-invariant features helps to achieve this goal, whereas it underpins unlabeled samples drawn from a single or multiple explicit target domains …
One of the current challenges in machine learning is how to deal with data coming at increasing rates in data streams. New predictive learning strategies are needed to cope with the high throughput data and concept drift. One of the data stream mining tasks where new learning strategies are needed is multi-target regre…
UDA learns target domain from unlabeled data via source knowledge transfer.
problem Learning unlabeled target domain data.
method Transferring both source knowledge and target-relatedness.
result Improves UDA performance by simultaneous knowledge transfer.
The paper analyzes an actor-critic algorithm with target networks for deep reinforcement learning.
problem Lack of theoretical understanding of target networks in actor-critic methods.
method Proposes a theoretical analysis of an online target-based actor-critic algorithm with linear function approximation.
result Establishes asymptotic convergence results and finite-time analysis for both critic and actor.
RL policy tracks dynamic targets in partially known environments robustly.
problem Active target tracking in partially known environments.
method Deep reinforcement learning (RL) approach for in-sight tracking, navigation, and exploration.
result Unified RL policy shows robust behavior for agile and anomalous targets.
The study investigates kernel-target alignment in tree ensemble kernels.
problem The degree of kernel-target alignment affects the performance of tree ensemble kernels in kernel learning.
method Eigenanalysis of the kernel matrix and sensitivity analysis via landmark learning.
result Good performance of tree ensemble kernels is associated with strong kernel-target alignment.
PQ-learning improves Q-learning by periodically updating target estimates.
problem Improving sample complexity in Q-learning for finding optimal policies.
method Maintains two Q-value estimates, one online and one target, updated periodically.
result PQ-learning achieves better sample complexity for finding epsilon-optimal policies.
RL models improve target control in SSGs for security applications.
problem Improving RL algorithms for target control in SSGs.
method Investigates improvements to target representations in RL algorithms.
result Enhanced RL models control targets better in SSGs.
In this paper, we present a new approach to Transfer Learning (TL) in Reinforcement Learning (RL) for cross-domain tasks. Many of the available techniques approach the transfer architecture as a method of speeding up the target task learning. We propose to adapt and reuse the mapped source task optimal-policy directly …
Federated learning method improves covariate shift adaptation for missing target values.
problem Missing target values in federated learning.
method Federated covariate shift adaptation algorithm for missing target output values.
result Asymptotically unbiased and efficient algorithm for federated learning.
Method transfers knowledge without label overlap, source data, or target architecture consistency.
problem Difficulties in transfer learning due to label mismatch, restricted source data, and specialized target architectures.
method Uses deep generative models in two stages: pseudo pre-training and pseudo semi-supervised learning.
result Outperforms scratch training and knowledge distillation methods.
Enhanced Bayesian target encoding uses sampling techniques to improve model performance.
problem Improving target encoding for better model performance in machine learning.
method Using sampling techniques in Bayesian target encoding to extract intra-category distribution information.
result Improves generalization and reduces target leakage in machine learning models.
Charities can increase donations by targeting optimal recipients.
problem Ineffective fundraising leads to lower resources for goods.
method Combines field experiment and causal machine-learning approach.
result Machine-learning-based optimal targeting increases donations significantly.
Transfer learning aims to faciliate learning tasks in a label-scarce target domain by leveraging knowledge from a related source domain with plenty of labeled data. Often times we may have multiple domains with little or no labeled data as targets waiting to be solved. Most existing efforts tackle target domains separa…
This paper analyzes how periodic and soft target updates stabilize linear Q-learning.
problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.
In remote sensing, it is often challenging to acquire or collect a large dataset that is accurately labeled. This difficulty is usually due to several issues, including but not limited to the study site's spatial area and accessibility, errors in the global positioning system (GPS), and mixed pixels caused by an image'…
The goal of transfer learning is to improve the performance of target learning task by leveraging information (or transferring knowledge) from other related tasks. In this paper, we examine the problem of transfer distance metric learning (DML), which usually aims to mitigate the label information deficiency issue in t…
For deep learning applications, the massive data development (e.g., collecting, labeling), which is an essential process in building practical applications, still incurs seriously high costs. In this work, we propose an effective data augmentation method based on generative adversarial networks (GANs), called Domain Fu…
Framework improves target domain prediction using quantile matching.
problem Improving prediction accuracy in data-scarce target domains.
method Conditional quantile matching for distributional alignment.
result Empirical risk minimizer achieves tighter excess risk bound.
This study models target trajectories using stochastic processes for efficient tracking.
problem Efficiently modeling and predicting target trajectories in continuous time.
method Decomposes trajectory modeling into deterministic and stochastic components using Gaussian or Student's-t processes. result Demonstrates superior performance in tracking maneuvering targets compared to existing methods.
Enhances source domain knowledge with target data for transfer learning.
problem Limited data in target domains and rigid model assumptions in transfer learning.
method Transfer learning through Enhanced Sufficient Representation (TESR).
result TESR enhances source domain knowledge with target data, improving transfer learning performance.
Two-parameter models can learn high-dimensional targets via gradient flow.
problem Learning high-dimensional targets with limited parameters.
method Gradient flow approach for W<d models. result Two-parameter models can learn targets with arbitrarily high success probability.
GEFA predicts drug-target affinity using graph neural networks.
problem Accurate prediction of drug-target interactions for rapid drug repurposing.
method GEFA (Graph Early Fusion Affinity) is a novel graph-in-graph neural network with attention mechanism.
result GEFA effectively models drug-target interactions, demonstrating the effectiveness of pre-trained protein embedding and nested graph representation.
Q-learning is one of the most popular methods in Reinforcement Learning (RL). Transfer Learning aims to utilize the learned knowledge from source tasks to help new tasks to improve the sample complexity of the new tasks. Considering that data collection in RL is both more time and cost consuming and Q-learning converge…
Radio frequency (RF) sensors are used alongside other sensing modalities to provide rich representations of the world. Given the high variability of complex-valued target responses, RF systems are susceptible to attacks masking true target characteristics from accurate identification. In this work, we evaluate differen…
A multi-step framework tackles online unsupervised domain adaptation with novel mean-target subspace computation.
problem Online unsupervised domain adaptation with unlabelled target data arriving sequentially.
method Multi-step framework with a novel mean-target subspace computation and temporal coherency consideration.
result Improved performance over previous approaches on four datasets.
Self-taught learning is a technique that uses a large number of unlabeled data as source samples to improve the task performance on target samples. Compared with other transfer learning techniques, self-taught learning can be applied to a broader set of scenarios due to the loose restrictions on the source data. Howeve…
Improved sample complexity for target Q-learning in finite MDPs with generative oracle.
problem Sample complexity of target Q-learning in finite MDPs with a generative oracle.
method Analyzed target Q-learning algorithm in tabular case with a generative oracle, improved sample complexity.
result Improved sample complexity for target Q-learning in various scenarios.
GAIT-prop derives a biologically plausible learning rule from backpropagation.
problem Biological implausibility in traditional backpropagation for neural networks.
method GAIT-prop uses a top-down model to convert output error into plausible targets for weight updates.
result GAIT-prop and backpropagation give identical weight updates under certain conditions.
This work explores Target Networks and Functional Regularization in deep Reinforcement Learning.
problem Stability and performance issues in deep Reinforcement Learning due to target value instability.
method Proposes and studies an explicit Functional Regularization approach as a replacement for Target Networks.
result Functional Regularization improves performance and stability compared to Target Networks.
Targeted Learning uses robust statistics for reproducible research.
problem Improving reproducibility and rigor in statistical analyses.
method Principled standard for statistical estimation and inference, minimizing assumptions.
result Enhances reliability of statistical conclusions.
A new meta-learning framework that assigns weights to source tasks based on target samples.
problem Learning initialization for target tasks with limited labeled examples.
method A general framework that assigns weights to the loss of different source tasks, which can depend on the target samples. Provides upper bounds and develops a learning algorithm based on minimizing the error bound with respect to an empirical IPM.
result Empirically, the weighted meta-learning algorithm finds better initializations than uniformly-weighted meta-learning algorithms.
Target encoding is an effective technique to deliver better performance for conventional machine learning methods, and recently, for deep neural networks as well. However, the existing target encoding approaches require significant increase in the learning capacity, thus demand higher computation power and more trainin…
This paper quantifies how hard it is to identify specific data points in machine learning models.
problem Quantifying the difficulty of identifying specific data points in machine learning models.
method Characterizing optimal attacks and privacy defences, deriving impacts of noise and misspecification, and proposing a new covariance attack.
result The Mahalanobis distance explains the hardness of fixed-target membership inference attacks.
The task of learning a sentiment classification model that adapts well to any target domain, different from the source domain, is a challenging problem. Majority of the existing approaches focus on learning a common representation by leveraging both source and target data during training. In this paper, we introduce a …
Method learns feature map between source and target domains for high-dimensional regression with missing features.
problem High-dimensional regression with differing feature sets in target and source domains.
method First learns a feature map between missing and observed features using source data, then imputes missing features in target domain, and performs two-step transfer learning for penalized regression.
result Developed upper bounds on estimation and prediction errors for HTL, showing dependence on model complexity, sample size, feature map quality, and domain differences.
Framework improves policy generalizability under biased training data.
problem Learning policies that generalize to a target population from biased training data.
method Characterizes sample selection bias using a selection variable, optimizes minimax value over uncertainty set, derives efficient algorithm.
result Policies generalize to target population, outperform standard methods.
DRDA robustly adapts models across domains with mismatched distributions.
problem Vulnerability of DA methods to noise and inability to generalize to unseen samples.
method DRDA uses distributionally robust optimization (DRO) with MMD metric to learn robust decision functions.
result DRDA outperforms existing robust learning approaches in experiments.
Paper introduces IC-index to evaluate interaction prediction methods.
problem Evaluate interaction prediction methods using IC-index.
method IC-index measures interaction direction prediction performance.
result IC-index complements existing prediction performance estimators.