Develops Bayesian approach for end-to-end learning in stochastic optimization.
problem Stochastic optimization problems under uncertainty.
method Bayesian interpretation and new end-to-end learning algorithms.
result Improved decision maps for empirical risk minimization and distributionally robust optimization.
End-to-end policy learning method improves CATE estimation.
problem Learning optimal treatment policies from partially observed data.
method Modified causal forest for policy learning.
result Maximizing policy value is equivalent to minimizing CATE.
We present differentiable particle filters (DPFs): a differentiable implementation of the particle filter algorithm with learnable motion and measurement models. Since DPFs are end-to-end differentiable, we can efficiently train their models by optimizing end-to-end state estimation performance, rather than proxy objec…
New algorithm improves causal effect estimation for continuous treatments.
problem Observational causal inference with continuous treatments.
method End-to-end entropy balancing for maximizing causal inference accuracy.
result Our algorithm estimates causal effect more accurately than baseline.
We provide an end-to-end differentially private spectral algorithm for learning LDA, based on matrix/tensor decompositions, and establish theoretical guarantees on utility/consistency of the estimated model parameters. The spectral algorithm consists of multiple algorithmic steps, named as "{edges}", to which noise cou…
This paper introduces the Differentiable Algorithm Network (DAN), a composable architecture for robot learning systems. A DAN is composed of neural network modules, each encoding a differentiable robot algorithm and an associated model; and it is trained end-to-end from data. DAN combines the strengths of model-driven …
New algorithm trains latent diffusion models using interacting particles.
problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.
WEEND uses a neural network to recognize speech and assign speakers to words.
problem End-to-end neural diarization without additional ASR and orchestration.
method Multi-task learning with an auxiliary network for ASR and speaker diarization.
result WEEND outperforms turn-based diarization and can handle 5-minute audio.
Kauri is a novel unsupervised binary tree for clustering that outperforms existing methods.
problem Learning a tree end-to-end for clustering without labels is an open challenge.
method Greedy maximization of the kernel KMeans objective without centroids.
result Kauri often outperforms existing unsupervised clustering methods, especially with non-linear kernels.
LoCo learns local representations without end-to-end synchronization, improving performance on complex tasks.
problem Learning local representations without end-to-end synchronization constraints.
method Overlap local blocks to increase decoder depth and allow feedback from upper to lower layers.
result LoCo closes the performance gap between local learning and end-to-end contrastive learning.
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.
A new type of End-to-End system for text-dependent speaker verification is presented in this paper. Previously, using the phonetically discriminative/speaker discriminative DNNs as feature extractors for speaker verification has shown promising results. The extracted frame-level (DNN bottleneck, posterior or d-vector) …
End-to-end Sinkhorn Autoencoder reduces data simulation time with noise generation.
problem Efficiently simulating data collection processes with high fidelity and speed.
method End-to-end Sinkhorn Autoencoder with noise generator.
result Outperforms competing methods on various datasets.
PyODDS is an end-to end Python system for outlier detection with database support. PyODDS provides outlier detection algorithms which meet the demands for users in different fields, w/wo data science or machine learning background. PyODDS gives the ability to execute machine learning algorithms in-database without movi…
Partially observable environments present an important open challenge in the domain of sequential control learning with delayed rewards. Despite numerous attempts during the two last decades, the majority of reinforcement learning algorithms and associated approximate models, applied to this context, still assume Marko…
The idea of end-to-end learning of communication systems through neural network-based autoencoders has the shortcoming that it requires a differentiable channel model. We present in this paper a novel learning algorithm which alleviates this problem. The algorithm enables training of communication systems with an unkno…
DeepRacing uses neural networks to predict trajectories for autonomous racing in video games.
problem Training algorithms for high-speed autonomous racing in realistic environments.
method Developed a virtual testbed using F1 video games, trained neural networks to predict trajectories and control commands.
result Trajectory prediction outperforms end-to-end control methods in autonomous racing simulations.
This paper presents an efficient binarized algorithm for both learning and classification of human epileptic seizures from intracranial electroencephalography (iEEG). The algorithm combines local binary patterns with brain-inspired hyperdimensional computing to enable end-to-end learning and inference with binary opera…
Hybrid model for online nonlinear prediction using LSTM and soft GBDT.
problem Online nonlinear prediction with manual feature selection and model selection issues.
method End-to-end architecture with LSTM for feature extraction and soft GBDT for regression, jointly optimized.
result Significant performance improvements over conventional methods on real datasets.
Proposes a new method for decision-aware learning in optimization.
problem Contextual linear optimization with cost prediction errors.
method Reweighing prediction error by decision regret for decision-aware predictor.
result Improves over predict-then-optimize framework for misspecified models.
The idea of end-to-end learning of communications systems through neural network -based autoencoders has the shortcoming that it requires a differentiable channel model. We present in this paper a novel learning algorithm which alleviates this problem. The algorithm iterates between supervised training of the receiver …
Quantum algorithm for multi-asset option pricing under different volatility models.
problem Efficiently pricing multi-asset options under various volatility models using quantum computing.
method Developed an end-to-end quantum PDE framework for European option pricing, solving PDEs after discretization on spatial grids.
result Quantum framework provides polynomial improvement in resource usage compared to classical methods.
End-to-end CNN for real-time MOD improves KITTI dataset accuracy by 8%.
problem Real-time detection of moving objects for autonomous vehicles.
method Spatio-temporal context and time-aware architecture using optical flow.
result Improvement of 8% in KITTI dataset accuracy compared to baselines.
We introduce efficient algorithms which achieve nearly optimal regrets for the problem of stochastic online shortest path routing with end-to-end feedback. The setting is a natural application of the combinatorial stochastic bandits problem, a special case of the linear stochastic bandits problem. We show how the diffi…
New algorithm learns POMDPs without computational oracles.
problem Learning near-optimal policies in POMDPs with computationally hard oracles.
method Quasipolynomial-time algorithm using barycentric spanners for policy covers.
result First oracle-free learning algorithm for observable POMDPs.
Deep learning improves options trading without market assumptions.
problem Traditional options trading requires market dynamics and pricing models.
method End-to-end deep learning approach that learns from market data.
result Deep learning models outperform existing trading strategies.
End-to-end portfolio system accounts for model risk.
problem Model risk in portfolio selection.
method Distributionally robust optimization with convex duality.
result Explicitly accounts for model risk in portfolio selection.
KEMP predicts long-term trajectories for autonomous driving using keyframes.
problem Predicting future trajectories of road agents for autonomous driving.
method Keyframe-based hierarchical end-to-end deep learning framework.
result Ranked 1st on Waymo Open Motion Dataset Leaderboard.
Regularization is important for end-to-end speech models, since the models are highly flexible and easy to overfit. Data augmentation and dropout has been important for improving end-to-end models in other domains. However, they are relatively under explored for end-to-end speech models. Therefore, we investigate the e…
Deep learning has revolutionized the ability to learn "end-to-end" autonomous vehicle control directly from raw sensory data. While there have been recent extensions to handle forms of navigation instruction, these works are unable to capture the full distribution of possible actions that could be taken and to reason a…
This paper introduces the QMDP-net, a neural network architecture for planning under partial observability. The QMDP-net combines the strengths of model-free learning and model-based planning. It is a recurrent policy network, but it represents a policy for a parameterized set of tasks by connecting a model with a plan…
PyODDS automates outlier detection for new data sources.
problem Manual outlier detection is inefficient and domain-specific.
method Automated end-to-end system with Apache Spark and database support.
result PyODDS optimizes outlier detection pipelines automatically.
Estimating statistical uncertainties allows autonomous agents to communicate their confidence during task execution and is important for applications in safety-critical domains such as autonomous driving. In this work, we present the uncertainty-aware imitation learning (UAIL) algorithm for improving end-to-end control…
Hybrid deep architectures with reasoning layers show promising convergence and generalization properties.
problem Understanding the theoretical foundations of hybrid deep architectures with reasoning layers.
method Analyzing the interplay between algorithm layers and neural components in deep architectures.
result Properties of algorithm layers are closely related to the approximation and generalization abilities of end-to-end models.
End-to-end speech recognition system trained on GPUs and CPUs.
problem Building state-of-the-art speech recognition systems.
method Utilizes CPUs and GPUs for training, data augmentation, and neural network updates. Uses vocal tract length perturbation and acoustic simulator for data augmentation. Employed Horovod allreduce for training.
result Achieved 7.92% WER on proprietary English Bixby open domain test set using a Bidirectional Full Attention (BFA) model.
End-to-end autonomous driving models get better uncertainty estimates.
problem Uncertainty quantification for end-to-end autonomous driving models.
method Approximate inference for implicit copula neural linear model.
result Densities for steering angle are marginally calibrated.
This work proposes splitting deep neural networks into smaller sub-networks for faster and more efficient distillation.
problem Challenges in training deep neural networks, including local optima, gradient issues, and computational demands.
method Proposes a non-end-to-end distillation approach by splitting networks into smaller, independent sub-networks (neighbourhoods).
result Independent training of smaller sub-networks can speed up distillation and improve efficiency in various applications.
Paper introduces a method to infer causal direction from limited data.
problem Inference of causal direction from limited observational data.
method Meta learning combined with causal inference to create a generative model.
result The method accurately infers causal direction across various dataset sizes.
End-to-end learning refers to training a possibly complex learning system by applying gradient-based learning to the system as a whole. End-to-end learning system is specifically designed so that all modules are differentiable. In effect, not only a central learning machine, but also all "peripheral" modules like repre…
End-to-end autonomous driving perception learns latent features for better performance.
problem Current autonomous driving systems are complex and require human engineering.
method Sequential latent representation learning for end-to-end perception.
result End-to-end perception model solves detection, tracking, localization, and mapping problems.
cuSLINK clusters data faster on GPUs, saving space and time.
problem Efficiently clustering large datasets on GPUs.
method Reformulated SLINK algorithm on GPU with optimized building blocks.
result cuSLINK uses O(Nk) space and trades off space and time with parameter k. End-to-end algorithm for controlling bilinear systems with probabilistic noise.
problem Controlling bilinear systems with noisy data.
method Proposes an end-to-end algorithm using statistical learning theory and robust controller design.
result Derived finite sample identification error bounds and structurally suitable for control.
Conventional decision trees have a number of favorable properties, including interpretability, a small computational footprint and the ability to learn from little training data. However, they lack a key quality that has helped fuel the deep learning revolution: that of being end-to-end trainable, and to learn from scr…
This work proposes a method to integrate algorithms into neural networks using continuous relaxation.
problem Training neural networks with new forms of supervision like ordering constraints.
method Relaxing discrete conditions in control structures like conditional statements, loops, and indexing to make them differentiable.
result The proposed method can keep up with relaxations designed for specific tasks, showing general applicability.
End-to-end training of DBMs with improved gradient estimation.
problem Biased gradient estimation in DBMs, especially with high-dimensional states.
method Unbiased contrastive divergence using MH coupling and local mode initialization.
result End-to-end training of DBMs without greedy pretraining, achieving FID score of 10.33 for MNIST.
BPQP improves efficiency of differentiable optimization layers for deep learning.
problem Efficiency in differentiating optimization problems for deep learning models.
method Reformulates optimization problems as quadratic programming, enabling efficient gradient calculation.
result Significant improvement in efficiency (order of magnitude faster) compared to other differentiable optimization layers.
End-to-end solution for recognizing handwritten numerals, avoiding traditional preprocessing steps.
problem Handwritten numeral string recognition with traditional preprocessing steps.
method YoLo-based model for automatic detection and recognition, avoiding heuristic-based preprocessing and segmentation.
result Proposed method reduces complexity and is a feasible end-to-end solution for numeral string recognition.
Neural networks struggle with TSP beyond small instances, requiring new approaches.
problem Neural networks struggle to generalize to larger instances of the TSP.
method Unified pipeline to identify inductive biases and promote generalization.
result Zero-shot generalization requires rethinking neural combinatorial optimization.