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.
The paper compares unrolling and bilevel optimization for learning variational models.
Statistical analysis of algorithm unrolling for inverse problems.
Unrolled networks learn optimal Bayesian inference for unknown priors.
E2Efold predicts RNA secondary structures better than previous methods.
While neural networks have achieved vastly enhanced performance over traditional iterative methods in many cases, they are generally empirically designed and the underlying structures are difficult to interpret. The algorithm unrolling approach has helped connect iterative algorithms to neural network architectures. Ho…
This work analyzes the convergence rate of unrolling for optimizing quadratic objectives.
Blind image deblurring remains a topic of enduring interest. Learning based approaches, especially those that employ neural networks have emerged to complement traditional model based methods and in many cases achieve vastly enhanced performance. That said, neural network approaches are generally empirically designed a…
ES-Single uses ES to estimate gradients in unrolled graphs, reducing variance and improving performance.
This work improves dictionary learning speed without sacrificing accuracy.
PES method reduces bias in gradient estimation for unrolled graphs.
PUDLE method analyzes and improves unrolled sparse coding networks for dictionary learning.
The paper develops generalization bounds for deep compound Gaussian neural networks.
This paper accelerates TV regularization algorithms by unrolling proximal gradient descent.
Recurrent convolution (RC) shares the same convolutional kernels and unrolls them multiple steps, which is originally proposed to model time-space signals. We argue that RC can be viewed as a model compression strategy for deep convolutional neural networks. RC reduces the redundancy across layers. However, the perform…
New neural network improves MRI reconstruction for non-Cartesian data.
Modified Hennings invariant defined using quantum groups and integrals.
Unrolled neural networks emerged recently as an effective model for learning inverse maps appearing in image restoration tasks. However, their generalization risk (i.e., test mean-squared-error) and its link to network design and train sample size remains mysterious. Leveraging the Stein's Unbiased Risk Estimator (SURE…
uGLAD recovers sparse graphs from data using deep unrolled networks.
We show that unrolled quantum groups at odd roots of unity give rise to relative modular categories. These are the main building blocks for the construction of 1+1+1-TQFTs extending CGP invariants, which are non-semisimple quantum invariants of closed 3-manifolds decorated with ribbon graphs and cohomology classes. Whe…
This paper introduces Non-Autonomous Input-Output Stable Network(NAIS-Net), a very deep architecture where each stacked processing block is derived from a time-invariant non-autonomous dynamical system. Non-autonomy is implemented by skip connections from the block input to each of the unrolled processing stages and al…
We introduce a method to stabilize Generative Adversarial Networks (GANs) by defining the generator objective with respect to an unrolled optimization of the discriminator. This allows training to be adjusted between using the optimal discriminator in the generator's objective, which is ideal but infeasible in practice…
Quantum groups give lower genus bounds for links.
LASE learns graph embeddings by unrolling GD iterations into a neural network.
Transformers interpreted as probabilistic Laplacian Eigenmaps steps.
We introduce an architecture based on deep hierarchical decompositions to learn effective representations of large graphs. Our framework extends classic R-decompositions used in kernel methods, enabling nested part-of-part relations. Unlike recursive neural networks, which unroll a template on input graphs directly, we…
In this work, we propose a deep neural network architecture motivated by primal-dual splitting methods from convex optimization. We show theoretically that there exists a close relation between the derived architecture and residual networks, and further investigate this connection in numerical experiments. Moreover, we…
Given a set of observations generated by an optimization process, the goal of inverse optimization is to determine likely parameters of that process. We cast inverse optimization as a form of deep learning. Our method, called deep inverse optimization, is to unroll an iterative optimization process and then use backpro…
Linear encoding of sparse vectors is widely popular, but is commonly data-independent -- missing any possible extra (but a priori unknown) structure beyond sparsity. In this paper we present a new method to learn linear encoders that adapt to data, while still performing well with the widely used decoder. The …
Many challenging image processing tasks can be described by an ill-posed linear inverse problem: deblurring, deconvolution, inpainting, compressed sensing, and superresolution all lie in this framework. Traditional inverse problem solvers minimize a cost function consisting of a data-fit term, which measures how well a…
In many settings (e.g., robotics) demonstrations provide a natural way to specify tasks; however, most methods for learning from demonstrations either do not provide guarantees that the artifacts learned for the tasks, such as rewards or policies, can be safely composed and/or do not explicitly capture history dependen…
We develop the general theory for the construction of Extended Topological Quantum Field Theories (ETQFTs) associated with the Costantino-Geer-Patureau quantum invariants of closed 3-manifolds. In order to do so, we introduce relative modular categories, a class of ribbon categories which are modeled on representations…
We prove the unrolled superalgebra has a completion which is a ribbon superalgebra in a topological sense where is a root of unity of odd order. Using this ribbon superalgebra we construct its universal invariant of links. We use it to construct an invariant of -manifolds of…
Accelerates Birkhoff projection for manifold-constrained hyper-connections with high accuracy and speed.
The study identifies conditions under which algorithmic stability explains generalization in interpolating learning systems.
ASTRA improves TDA by more accurately approximating iHVP.
Careful tuning of the learning rate, or even schedules thereof, can be crucial to effective neural net training. There has been much recent interest in gradient-based meta-optimization, where one tunes hyperparameters, or even learns an optimizer, in order to minimize the expected loss when the training procedure is un…
This work improves uncertainty estimates for LISTA estimators.
Hybrid deep architectures with reasoning layers show promising convergence and generalization properties.
Enhanced ECCD speeds up elastic net model training.
Neurally Augmented ALISTA improves sparse reconstruction performance.
Model-based Reinforcement Learning approaches have the promise of being sample efficient. Much of the progress in learning dynamics models in RL has been made by learning models via supervised learning. But traditional model-based approaches lead to `compounding errors' when the model is unrolled step by step. Essentia…
A Hermitian TQFT from non-semisimple quantum sl(2) modules.
Image reconstruction from undersampled k-space data has been playing an important role for fast MRI. Recently, deep learning has demonstrated tremendous success in various fields and also shown potential to significantly speed up MR reconstruction with reduced measurements. This article gives an overview of deep learni…
We develop a diagrammatic calculus for representations of unrolled quantum at a fourth root of unity. This allows us to prove Seifert-Torres type formulas for certain splice links using quantum algebraic methods, rather than topological methods. Other applications of this diagrammatic calculus given h…
New deep-unfolded network improves video background separation.
Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the i…
We propose dynamical systems trees (DSTs) as a flexible class of models for describing multiple processes that interact via a hierarchy of aggregating parent chains. DSTs extend Kalman filters, hidden Markov models and nonlinear dynamical systems to an interactive group scenario. Various individual processes interact a…
We propose a new nonlinear factorization model for graphs that are with topological structures, and optionally, node attributes. This model is based on a pseudometric called Gromov-Wasserstein (GW) discrepancy, which compares graphs in a relational way. It estimates observed graphs as GW barycenters constructed by a se…