Paper introduces a multi-stage influence function to track model predictions.
problem Improving natural language processing and computer vision performance.
method Develops a multi-stage influence function to track predictions from finetuned models back to pretraining data.
result Identifies pretraining examples contributing most to finetuning task predictions.
CSAC enables cooperative reinforcement learning for multi-stage tasks.
problem Coordinating consecutive reinforcement learning agents for long-term multi-stage tasks.
method CSAC modifies each agent's policy to maximize both current and next agent's critic.
result CSAC outperforms uncooperative policies and single-agent training in multi-room maze domain.
Method learns multi-stage tasks from single video, overcoming challenges of raw pixel learning and insufficient demonstrations.
problem Learning multi-stage vision-based tasks from a single video of a human performing the task.
method Learn primitive behaviors from video demonstrations and dynamically compose them to perform multi-stage tasks.
result Demonstrated learning of various tasks on real robots using raw pixel inputs and minimal demonstrations.
Improved online AED models with multi-stage training and multi-task learning.
problem Enhance performance of online attention-based encoder-decoder models.
method Three-stage training with character encoder, BPE encoder, and attention decoder; multi-task learning at character and BPE levels; transfer learning from bidirectional encoder.
result 35% and 10% relative improvement over baselines for smaller and bigger models, respectively.
Improves classifier performance in multi-stage processes with adversarial autoencoders and multi-task learning.
problem Challenges in training classifiers due to varying sample sizes and information content across stages.
method Combines adversarial autoencoders, multi-task learning, and semi-supervised learning to address underfitting and overfitting.
result Our approach outperforms state-of-the-art methods across different domains.
Paper proposes M3S training for GCNs on graphs with few labels.
problem Learning graph embeddings with few labeled nodes is challenging.
method Multi-Stage Self-Supervised (M3S) Training Algorithm combining self-supervised learning.
result M3S Training Algorithm improves GCNs' generalization on graphs with few labeled nodes.
Study uses deep neural networks for causal inference tasks, especially in high-dimensional settings.
problem Challenges in direct estimation for complex causal inference tasks.
method Sequential multi-stage learning with doubly robust deep neural networks.
result Theoretical guarantees for DNNs' effectiveness in high-dimensional causal inference.
Multi-task sparse feature learning aims to improve the generalization performance by exploiting the shared features among tasks. It has been successfully applied to many applications including computer vision and biomedical informatics. Most of the existing multi-task sparse feature learning algorithms are formulated a…
Guided Learning improves end-to-end modeling for multi-stage decision-making.
problem Challenges in training unified neural networks for multi-stage decision-making.
method Guided Learning framework with a guide function and utility function.
result Significant improvement in performance over traditional methods.
SDQL uses modular deep Q networks to efficiently learn multi-stage optimal control tasks.
problem Training complex deep reinforcement learning models for multi-stage control tasks is inefficient and unstable.
method Stacked Deep Q Learning (SDQL) with modular Q networks and backward training.
result SDQL efficiently learns optimal control policies for multi-stage tasks with high-dimensional state and action spaces.
Multi-task feature learning aims to identity the shared features among tasks to improve generalization. It has been shown that by minimizing non-convex learning models, a better solution than the convex alternatives can be obtained. Therefore, a non-convex model based on the capped-ℓ1,ℓ1 regularization wa…
Improves disentangled representation learning with multi-stage modeling.
problem Trade-off between disentanglement and reconstruction quality in autoencoders.
method Penalty-based disentanglement learning followed by detail information modeling.
result Higher reconstruction quality than state-of-the-art methods with equivalent disentanglement.
Method solves long-horizon robotic tasks via imitation and reinforcement learning.
problem Long-horizon robotic tasks with complex sequences of actions.
method Two-phase approach: imitation learning followed by reinforcement learning.
result Method can scale to challenging long-horizon tasks.
This paper develops a learning framework for optimal strategies in multi-stage decentralized matching markets.
problem Optimal strategies in multi-stage decentralized matching markets with uncertain preferences.
method Nonparametric statistical approach and variational analysis.
result Participants can be better off with multi-stage matching compared to single-stage matching.
Multi-stage financial decision optimization under uncertainty depends on a careful numerical approximation of the underlying stochastic process, which describes the future returns of the selected assets or asset categories. Various approaches towards an optimal generation of discrete-time, discrete-state approximations…
Paper introduces MSP Network for harmonizing images from different scanners.
problem Improving predictive performance and learning efficiency in data harmonization.
method Multi-Stage Prediction (MSP) Network integrating neural networks of different architectures.
result MSP Network shows 20% improvement in patch-based mean-squared error over state-of-the-art methods.
In this paper, we consider multi-stage stochastic optimization problems with convex objectives and conic constraints at each stage. We present a new stochastic first-order method, namely the dynamic stochastic approximation (DSA) algorithm, for solving these types of stochastic optimization problems. We show that DSA c…
Motivated by the problem of computer-aided detection (CAD) of pulmonary nodules, we introduce methods to propagate and fuse uncertainty information in a multi-stage Bayesian convolutional neural network (CNN) architecture. The question we seek to answer is "can we take advantage of the model uncertainty provided by one…
New method designs experiments robustly for nonlinear estimation, improving parameter knowledge.
problem Designing robust experiments for nonlinear estimation under parametric uncertainty.
method Multi-stage robust optimization framework for sequential experiments.
result Identifies experiments better conducted early for improved parameter knowledge.
This paper detects multi-stage Feint Attacks using Bi-RNN and few-shot learning.
problem Detecting multi-stage Feint Attacks due to lack of professional datasets and semantic relationships.
method Fuzzy clustering for attack chain mining, few-shot deep learning, Bi-RNN for feature extraction.
result Accurately detected Feint Attacks using Bi-RNN and few-shot learning.
Estimates and infers multi-stage stationary treatment policies with variable selection.
problem Valid inference for multi-stage stationary treatment policies with high-dimensional feature variables.
method Estimate the value function using augmented inverse probability weighted estimator, apply penalty for variable selection, construct one-step improvements for valid inference.
result Improved estimators are asymptotically normal, valid inference for policy parameters demonstrated.
Improves classifier performance in multi-stage selection processes.
problem Difficulty in training classifiers in multi-stage selection processes due to varying sample sizes and information.
method Multi-Stage Transfer Learning (MSGTL) approach that uses knowledge from simpler classifiers trained in early stages to improve later stages.
result MSGTL outperforms other transfer learning methods in real-world selection process data.
Efficiently compress neural networks with MUSCO method.
problem Compression of deep neural networks.
method Iterative approach alternating low-rank factorization with rank selection and fine-tuning.
result Improves compression rate while maintaining accuracy.
Adaptive multi-stage density ratio estimation improves learning of latent space EBM.
problem Learning energy-based models in latent space is computationally expensive and challenging.
method Adaptive multi-stage density ratio estimation using NCE to bridge the gap between prior and posterior densities.
result The method enables more expressive prior models and sharpens the latent space EBM.
Proposes a method to cluster tasks for constructive cooperative multi-tasking.
problem Destructive cooperation in cooperative multi-tasking.
method Semantic clustering followed by end-to-end joint training within clusters.
result Effective mitigation of destructive cooperation and negative transfer.
Estimates time-varying network connections using multi-stage smoothing.
problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.
Deep neural networks can grok better than shallow ones, showing multi-stage generalization.
problem Understanding the generalization behavior of deep neural networks.
method Empirical replication and analysis of grokking phenomenon in deep MLP models.
result Deep neural networks exhibit multi-stage generalization, with a secondary surge in test accuracy.
A number of recent work studied the effectiveness of feature selection using Lasso. It is known that under the restricted isometry properties (RIP), Lasso does not generally lead to the exact recovery of the set of nonzero coefficients, due to the looseness of convex relaxation. This paper considers the feature selecti…
This work improves speech enhancement using multiple GAN generators in stages.
problem Efficient speech enhancement using GANs with multiple stages.
method Multiple GAN generators in a chained multi-stage approach, with two scenarios: shared or independent parameters.
result Multi-stage SEGAN outperforms one-stage SEGAN, with independent generators yielding better results.
Joint sparsity regularization in multi-task learning has attracted much attention in recent years. The traditional convex formulation employs the group Lasso relaxation to achieve joint sparsity across tasks. Although this approach leads to a simple convex formulation, it suffers from several issues due to the loosenes…
A novel multi-stage clustering framework improves radar data processing for autonomous vehicles.
problem High sparsity and low dimensionality of radar data makes clustering challenging.
method First, filter out static background data. Then, apply a two-stage clustering approach: 1) low-dimensional clustering, 2) feature extraction from clusters.
result Clear benefits of the first two methods and cluster merging process under specific circumstances.
Paper uses RL to mitigate cascading failures in power systems.
problem Mitigating multi-stage cascading failures in power grids.
method Reinforcement Learning applied to DC-OPF for power flow optimization.
result Reduced system collapse rates through RL-based optimization.
In many classification systems, sensing modalities have different acquisition costs. It is often {\it unnecessary} to use every modality to classify a majority of examples. We study a multi-stage system in a prediction time cost reduction setting, where the full data is available for training, but for a test example, m…
Neural network with data augmentation improves multi-stage pump prediction accuracy.
problem Predicting multi-stage pump external characteristics with high accuracy.
method Neural network model with data augmentation for multi-objective prediction.
result Neural network model with data augmentation outperforms other models in accuracy.
OCEAN infers online task identities from context variables.
problem Online task inference for compositional tasks with context adaptation.
method Variational inference framework OCEAN models global and local context variables in a joint latent space.
result OCEAN provides more effective task inference with sequential context adaptation.
This paper presents a simple method for a posteriori (historical) multi-variate multi-stage optimal trading under transaction costs and a diversification constraint. Starting from a given amount of money in some currency, we analyze the stage-wise optimal allocation over a time horizon with potential investments in mul…
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained during execution of one task has value for the execution of another task. Consequently, the agent is intrinsically motivated to explore its envi…
A new algorithm reduces graph complexity for better dense subgraph analysis.
problem Mining dense subgraphs in large graphs for better analysis.
method Multi-stage graph peeling algorithm (M-PA) with two-stage data screening.
result M-PA produces similar dense subgraphs to the previous PA but with reduced graph complexity.
Owing to the ever-increasing demand in wireless spectrum, Cognitive Radio (CR) was introduced as a technique to attain high spectral efficiency. As the number of secondary users (SUs) connecting to the cognitive radio network is on the rise, there is an imminent need for centralized algorithms that provide high through…
Develops multi-task learning models for ordinal regression with heterogeneous data.
problem Tackling ordinal regression for heterogeneous, non-IID data.
method Sparse and deep multi-task learning approaches.
result Proposed MTOR models improve prediction performance.
Paper proposes a method to maintain ASR performance on new tasks without forgetting old ones.
problem Mitigating forgetting in ASR models when learning new tasks.
method A novel explainability-based knowledge distillation combined with response-based knowledge distillation.
result Our method outperforms existing ones in mitigating forgetting on multi-stage sequential training tasks.
Proposes a framework to optimize complex data constraints effectively.
problem Challenges in optimizing high-dimensional, noisy data with constraints.
method Multi-stage Constrained Optimization Framework (MCOF) with EC-VAE, UT, and CPM.
result Validated on synthetic and real-world problems, achieving feasible solutions.
Simple framework decouples word alignment and multilingual embedding mapping.
problem Learning multilingual embeddings without supervision.
method Two-stage approach: 1) unsupervised word alignment, 2) mapping embeddings to shared space.
result Robust performance across various multilingual tasks, including distant languages.
One of the challenges in computational acoustics is the identification of models that can simulate and predict the physical behavior of a system generating an acoustic signal. Whenever such models are used for commercial applications an additional constraint is the time-to-market, making automation of the sound design …
A method uses RL to learn abstractions for planning, improving robot navigation and manipulation tasks.
problem Planning requires suitable abstractions for states and transitions, which RL struggles with for temporally extended tasks.
method Goal-conditioned policies learned with RL are incorporated into planning, with a latent variable model representing valid states.
result Our method significantly outperforms prior work on image-based robot navigation and manipulation tasks.
SummaryNet automates video summarisation using deep learning.
problem Creating informative video summaries from videos.
method Two-stream convolutional network for spatial and temporal features, encoder-decoder model for salient features, sigmoid regression with LSTM for frame probability.
result SummaryNet achieves comparable or better results than state-of-the-art methods on benchmark datasets.
The paper proposes a new method to improve microcredit decisions by modeling sequential loan interactions.
problem Improving microcredit decision-making by addressing population bias and model generalization.
method The authors introduce a multi-stage interaction sequence (MSIS) method that models sequential loan interactions and uses a hierarchical attention module to leverage interaction information.
result The MSIS method effectively remedies population bias and improves model generalization on a real loan data set.
Introduces Conditional Action Trees to simplify RL action spaces.
problem Challenges in RL with large, complex action spaces.
method Structures action spaces and reduces complexity through Conditional Action Trees.
result Demonstrates effectiveness in reducing action space and improving decision making.