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…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
48 results for “End-to-End Differentiability”
DPQ offers significant compression at minimal cost for embedding layers.
problem Memory and storage constraints in embedding layers.
method Differentiable Product Quantization (DPQ) framework with two instantiations.
result Significant compression ratios (14-238) with negligible performance cost.
Differentiable Algorithm Networks (DAN) enable composable robot learning.
problem Training robots to learn from limited data and imperfect models.
method Composable architecture of neural network modules, each encoding a differentiable robot algorithm and model, trained end-to-end from data.
result DAN modules adapt to one another and compensate for imperfect models and algorithms, achieving best overall system performance.
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…
Differentiable CEM enables end-to-end learning of non-convex optimization problems.
problem Non-convex optimization of continuous, parameterized objective functions.
method Introducing a differentiable variant of the cross-entropy method (CEM).
result Differentiation of CEM output with respect to parameters enables end-to-end learning.
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.
New method learns latent structures for deep NLP models without tradeoffs.
problem Joint learning of latent structures and downstream predictors with end-to-end differentiability.
method SparseMAP inference for joint learning of latent structures and downstream predictors.
result First method to enable unrestricted dynamic computation graph construction from global latent structure while maintaining differentiability.
Differentiable MPC improves reinforcement learning efficiency.
problem Combining model-free and model-based reinforcement learning approaches.
method Differentiating through KKT conditions of a convex approximation of MPC.
result MPC policies are more data-efficient and superior to traditional system identification.
Differentiable clustering method using perturbed spanning forests.
problem Efficient clustering in trainable pipelines with noisy data.
method Stochastic perturbations of minimum-weight spanning forests.
result Method performs well even in challenging settings.
New algorithm trains communication systems without a differentiable channel model.
problem Training communication systems with unknown or non-differentiable channel models.
method Iterative training between receiver and transmitter using true and approximated gradients.
result Works as well as model-based training and achieves state-of-the-art performance.
End-to-end training of neural networks with black-box functions.
problem Training neural networks for tasks that require precise, non-differentiable functions.
method Approximate black-box functions with differentiable neural networks and integrate them into neural network training.
result Neural network trained to compute inputs for black-box functions, generalizing better and learning more efficiently.
Differentiable perturbed optimizers enable end-to-end learning of discrete decisions.
problem Discrete decisions in machine learning pipelines break back-propagation.
method Transform optimizers into differentiable operations using stochastically perturbed optimizers.
result Smoothness of derivatives can be tuned via noise amplitude.
Differentiable resampling improves particle filter performance.
problem Non-differentiability of traditional resampling in particle filters.
method Introduced a neural network resampler (particle transformer) trained with a likelihood-based loss function.
result Learned resampling outperforms traditional methods on synthetic and real-world tasks.
Perceive, Predict, and Plan: Safe Motion Planning Through Interpretable Semantic Representationscs.RO
End-to-end learnable network for safer self-driving with interpretable intermediate representations.
problem Safe motion planning for self-driving vehicles.
method Differentiable semantic occupancy representation for cost calculation in motion planning.
result Significantly outperforms state-of-the-art planners in imitating human behaviors and producing safer trajectories.
Paper proposes an end-to-end learning method for state estimation in robotics.
problem Lack of annotated data for optimising dynamic and measurement models in particle filters.
method End-to-end learning objective based on maximising a pseudo-likelihood function.
result Improves state estimation when large portions of true states are unknown.
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…
Integrates learning and optimization on graphs, improving prediction accuracy.
problem Combining learning and optimization on graphs with partially observed data.
method Proposes a decision-focused learning approach integrating a differentiable proxy for optimization problems.
result ClusterNet system outperforms pure end-to-end and standard approaches.
End-to-end unsupervised MOT from videos.
problem Challenging online Multi-Object Tracking from videos.
method Differentiable neural model for tracking and animation, end-to-end learning.
result End-to-end learning of MOT from videos without labeled data.
Proposes a deep diffusion watermarking framework for secure image processing.
problem Secure watermarking of deep neural networks in image processing.
method End-to-end training of two FCNNs with residual structure for embedding and extraction.
result Framework improves security and robustness with customizable trade-offs.
Although recent work in AI has made great progress in solving large, zero-sum, extensive-form games, the underlying assumption in most past work is that the parameters of the game itself are known to the agents. This paper deals with the relatively under-explored but equally important "inverse" setting, where the param…
DP-ADMM provides differential privacy for ADMM-based distributed learning.
problem Privacy concerns in ADMM-based distributed machine learning.
method Combines approximate augmented Lagrangian function with time-varying Gaussian noise addition.
result Achieves higher utility for general objective functions under the same differential privacy guarantee.
End-to-end trainable graph matching using improved combinatorial solvers.
problem Graph matching in deep learning.
method Combining deep learning with optimized combinatorial solvers.
result Advances state-of-the-art on deep graph matching benchmarks.
Machine reading using differentiable reasoning models has recently shown remarkable progress. In this context, End-to-End trainable Memory Networks, MemN2N, have demonstrated promising performance on simple natural language based reasoning tasks such as factual reasoning and basic deduction. However, other tasks, namel…
A new differentiable resampling method for Monte Carlo simulations.
problem Improving the efficiency and differentiability of resampling in Monte Carlo simulations.
method Proposes a diffusion model surrogate for resampling, proving consistency and outperforming existing methods.
result The proposed method outperforms state-of-the-art differentiable resampling methods on various benchmarks.
Connectionist temporal classification (CTC) is widely used for maximum likelihood learning in end-to-end speech recognition models. However, there is usually a disparity between the negative maximum likelihood and the performance metric used in speech recognition, e.g., word error rate (WER). This results in a mismatch…
NOVAS: Non-convex Optimization via Adaptive Stochastic Search for End-to-End Learning and Controlcs.LG
NOVAS uses adaptive stochastic search for non-convex optimization in deep networks.
problem Non-convex optimization challenges in deep neural networks.
method Adaptive stochastic search for non-convex optimization.
result NOVAS outperforms existing alternatives in a structured prediction task.
Paper optimizes KWS models using NAS and quantization for limited resources.
problem Developing efficient keyword spotting models in resource-constrained environments.
method Neural Architecture Search (NAS) for model structure optimization and quantization of weights and activations.
result Achieved high accuracy (95.55%) with minimal parameters and operations using NAS and quantization.
Development systems for deep learning (DL), such as Theano, Torch, TensorFlow, or MXNet, are easy-to-use tools for creating complex neural network models. Since gradient computations are automatically baked in, and execution is mapped to high performance hardware, these models can be trained end-to-end on large amounts…
Private learning needs more data or better features.
problem Improving differentially private machine learning performance.
method Demonstrates the need for either more private data or better features.
result Private learning requires either more data or better features.
Unified framework for differentiable graph partitioning with probabilistic cuts.
problem Lack of general guarantees and principled gradients in prior probabilistic relaxations of graph cuts.
method Unified probabilistic framework covering a wide class of cuts, including Normalized Cut, with tight analytic upper bounds.
result Rigorous, numerically stable foundation for scalable, differentiable graph partitioning.
DPLTM uses private winners to improve privacy and utility.
problem Balancing privacy and utility in machine learning models.
method DPLTM applies differential privacy to the lottery ticket method.
result DPLTM converges faster and uses less privacy budget.
Deep equilibrium models estimate latent variables from data.
problem Estimating latent variables from data.
method Generalized exponential family models, deep equilibrium networks.
result Deep equilibrium models solve MAP estimates for latent and transformation parameters.
TomOpt: Differential optimisation for task- and constraint-aware design of particle detectors in the context of muon tomographyphysics.ins-det
TomOpt optimizes muon detector designs using differentiable programming.
problem Designing efficient particle detectors for muon tomography.
method Differentiable programming for muon interaction modeling, inference, and optimisation.
result Demonstrated end-to-end differentiable and inference-aware optimisation of particle physics instruments.
KeypointNet learns 3D keypoints for object pose estimation without ground-truth.
problem Learning 3D keypoints for object pose estimation without manual annotations.
method End-to-end geometric reasoning framework to discover keypoints.
result End-to-end framework outperforms fully supervised baseline.
Improves regression accuracy by using multiple discrete representations.
problem Improving regression accuracy using deep learning.
method Proposes using multiple discrete representations simultaneously for regression problems.
result Reduces prediction error compared to a baseline RvC approach.
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 …
End-to-end clustering without labels using normalized cuts.
problem Clustering unlabeled data without supervision.
method Learning to optimize expected normalized cuts, differentiable loss function.
result State-of-the-art results on various benchmarks, generalizing to new datasets.
Worldsheet wraps a 3D mesh sheet onto a single image to synthesize novel views.
problem Synthesizing novel views from a single image with large viewpoint changes.
method Shrink-wrapping a planar mesh sheet onto the input image, consistent with learned depth.
result Worldsheet consistently outperforms prior methods on single-image view synthesis.
Differentiable NAS method optimizes network architecture and parameters efficiently.
problem Challenging to simultaneously guarantee effectiveness and efficiency in network architecture search.
method Differentiable architecture search with ensemble Gumbel-Softmax estimator.
result End-to-end mechanism for searching network architectures, discovering high-performance architectures efficiently.
Cilia are hairlike structures protruding from nearly every cell in the body. Diseases known as ciliopathies, where cilia function is disrupted, can result in a wide spectrum of disorders. However, most techniques for assessing ciliary motion rely on manual identification and tracking of cilia; this process is laborious…
Automated multi-task learning algorithm that optimizes network topology.
problem Over-sharing in multi-task learning leads to over-generalization and suboptimal performance.
method Tree-structured design space with gumbel-softmax sampling for differentiable network splitting.
result End-to-end trainable algorithm that optimizes network topology for multiple objectives across tasks.
End-to-end Dyna-AIL combines planning and learning for faster convergence.
problem Efficient imitation learning with minimal interactions.
method Dyna-like framework integrating model-based planning and model-free learning.
result Our approach converges to optimal policies with fewer interactions.
TOPNet integrates task-based evaluation into machine learning models.
problem Non-differentiable task-based evaluation criteria in real-world applications.
method Task-Oriented Prediction Network (TOPNet) with learnable surrogate loss function.
result TOPNet significantly outperforms traditional and heuristic models in financial prediction tasks.
DiffTaichi enables fast, differentiable physical simulations with shorter code.
problem Building efficient differentiable physical simulators.
method Differentiable programming language (DiffTaichi) that generates gradients using source code transformations and a light-weight tape.
result Differentiable physical simulators written in DiffTaichi are faster and more concise than existing methods.
DiPS learns to optimize sketching policies for better recommendation quality.
problem Optimizing sketching policies for long-term user interest prediction in recommender systems.
method Differentiable policy for sketching that learns from training data.
result DiPS requires up to 50% fewer sketch items to achieve the same recommendation quality.
Myriad offers a testbed for integrating machine learning and trajectory optimization.
problem Real-world trajectory optimization challenges.
method JAX-based testbed with machine learning and trajectory optimization integration.
result End-to-end learning and planning with neural ODEs.
Differentiable pipeline replaces non-differentiable CAE components for shape optimization.
problem Gradient-based optimization is limited by non-differentiable components in CAE workflows.
method Surrogate models replace non-differentiable pipeline components, enabling gradient-based optimization.
result Gradient-based shape optimization possible without differentiable solvers.
dynoNet learns dynamical systems using linear operators.
problem Learning complex dynamical systems.
method dynoNet uses linear dynamical operators for sequence modeling and system identification.
result dynoNet effectively identifies systems on benchmarks.