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.
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…
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.
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…
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.
The paper studies fairness in multi-stage selection problems and introduces a method to compute fair selections.
problem Fairness in multi-stage selection problems with additional features at each stage.
method Introducing fairness notions, proposing a linear program for fair selections, and defining the price of local fairness.
result It is possible to have a selection that has a small price of local fairness and is close to locally fair.
Greedy selection works well in a toy model of independent increments.
problem Iterative selection of maximum-value processes from i.i.d. stochastic processes.
method Fixed greedy selection at each stage.
result Optimal strategy is greedy selection under independent increments.
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.
This paper explores the following question: what kind of statistical guarantees can be given when doing variable selection in high-dimensional models? In particular, we look at the error rates and power of some multi-stage regression methods. In the first stage we fit a set of candidate models. In the second stage we s…
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.
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.
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.
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.
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…
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.
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.
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.
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…
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.
Proposes a method to optimize budget allocation for collecting and analyzing streaming data.
problem Optimizing resource allocation for collecting and analyzing streaming data.
method Formulates optimization problems to allocate budgets for collecting input data and running simulations, characterizes asymptotic behavior of performance estimators, and develops a multi-stage simultaneous budget allocation procedure.
result Demonstrates competitive performance of the proposed procedure through numerical studies.
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.
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 new feature selection method integrating feature relationships.
problem Feature selection in machine learning models.
method Integrates feature-feature and feature-target relationships via penalized mRMR.
result Correctly identifies inactive features, reducing false discoveries.
A novel method optimizes variable-stiffness structures for better strength and weight.
problem Optimizing variable-stiffness structures for higher strength and lighter weight.
method A novel multi-stage concurrent topology optimization scheme combining DMO, S-BPTO, and CFAO.
result The method ensures better fibre angle convergence and stable optimization.
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.
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.
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.
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.
HOTCAKE compresses CNNs by decomposing kernels into smaller parts.
problem Compressing deep CNNs without significant accuracy loss.
method Input channel decomposition, guided Tucker rank selection, higher order Tucker decomposition, fine-tuning.
result HOTCAKE produces highly compressed CNN models with good accuracy.
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…
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…
Study finds strict collection policies improve portfolio quality of microfinance banks.
problem Improving portfolio quality of microfinance banks through better credit collection policies.
method Multi-stage sampling, regression analysis, descriptive statistics.
result Collection policy has a higher effect on portfolio quality.
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.
The paper introduces a method for multi-agent reinforcement learning to coordinate exploration.
problem Sparse rewards in multi-agent settings lead to independent exploration.
method Designing intrinsic rewards that encourage coordination and developing a hierarchical policy.
result The approach accelerates and improves exploration in cooperative multi-agent settings.
We consider the problem of learning multi-stage vision-based tasks on a real robot from a single video of a human performing the task, while leveraging demonstration data of subtasks with other objects. This problem presents a number of major challenges. Video demonstrations without teleoperation are easy for humans to…
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 …
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…
New methods solve complex financial equations.
problem Solving backward stochastic differential equations driven by continuous-time Markov chains.
method Multi-stage Euler-Maruyama methods and multilevel spatial discretization.
result Efficiently solved stiff Markov BSDEs.
Client appraisal improves efficiency in microfinance banks in Adamawa State.
problem Increasing loan defaults and losses in microfinance institutions.
method Survey method with primary and secondary data collection, multi-stage sampling, questionnaires, descriptive and inferential statistics.
result Client appraisal positively affects efficiency and productivity.
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.
New insights into how to inspect and learn from multi-stage processes and AI reasoning.
problem Understanding how to attribute outcomes to early stages in multi-stage operations and AI reasoning.
method Information-theoretic analysis and mathematical proofs of four key results.
result Uniform checkpoint spacing is minimax-optimal for inspection design under homogeneous signal attenuation.
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.
Combines k-means and hill climbing for stratification and allocation.
problem Optimizing stratification and sample allocation for complex surveys.
method Combining k-means type algorithms with hill climbing.
result Multi-stage combination algorithms generally perform well compared to recent methods.
Two-stage framework detects multi-modal outliers.
problem Detecting outliers in multi-modal data structures.
method Combines global kernel PCA and local clustering stages.
result Significantly outperforms existing methods on challenging datasets.