Research
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.

168,932 papers · 148 categories

Trend · papers per month

2515027521,003 · Jun 202019922001200920172026
48 results for unrolled neural networks

This paper analyzes the generalization risk of unrolled neural networks using Stein's Unbiased Risk Estimator.

problem Analyzing the generalization risk of unrolled neural networks and its relationship to network design and train sample size.
method Using Stein's Unbiased Risk Estimator (SURE), the paper analyzes the generalization risk with bias and variance components for recurrent unrolled networks, focusing on the degrees-of-freedom (DOF) component and the trace of the end-to-end network Jacobian.
result DOF is well-approximated by the weighted path sparsity of the network under incoherence conditions on the trained weights, and DOF increases with train sample size and converges to the generalization risk for both recurrent and non-recurrent schemes.

Statistical analysis of algorithm unrolling for inverse problems.

problem Designing deep neural networks to solve inverse problems efficiently.
method Analysis of gradient descent network (GDN) unrolling depth and statistical performance.
result The optimal statistical performance of GDNs requires unrolling depth of order log(n)/log(ρ_n^-1), where ρ_n is the convergence rate.

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…

2019-02-09abs ↗pdf ↗

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…

2019-02-09abs ↗pdf ↗

The paper develops generalization bounds for deep compound Gaussian neural networks.

problem Developing theoretical guarantees for the performance of deep neural networks.
method Novel generalization error bounds using a compound Gaussian prior and Dudley's integral.
result Theoretical bounds show generalization error scales O(nln(n))\mathcal{O}(n\sqrt{\ln(n)}) in signal dimension and O((NetworkSize)3/2)\mathcal{O}((Network Size)^{3/2}) in network size.

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…

2017-03-16abs ↗pdf ↗

ES-Single uses ES to estimate gradients in unrolled graphs, reducing variance and improving performance.

problem Estimating gradients in unrolled computation graphs with low variance and stability.
method Evolution strategies (ES) applied to unrolled graphs, with a single perturbation per particle.
result ES-Single reduces variance compared to PES, leading to better performance in various tasks.

PUDLE method analyzes and improves unrolled sparse coding networks for dictionary learning.

problem Dictionary learning problem, representing data as a combination of few atoms.
method PUDLE method addresses challenges in unrolled sparse coding networks through theoretical analysis and practical strategies.
result PUDLE method provides conditions for recovering and preserving the support of the latent code, and resolves bias and instability issues.

The paper compares unrolling and bilevel optimization for learning variational models.

problem Learning variational models in supervised learning.
method Analyzes unrolling and bilevel optimization approaches for variational models.
result Unrolling can be better than bilevel optimization, but performance depends on parameters.

PES method reduces bias in gradient estimation for unrolled graphs.

problem High variance and bias in gradient estimation for unrolled computation graphs.
method Divide graph into unrolls, apply ES update, accumulate correction terms.
result PES provides unbiased, low-variance gradient estimates.

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…

2018-06-15abs ↗pdf ↗

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…

2016-11-07abs ↗pdf ↗

Bayesian neural networks learn graph structure with interpretable parameters.

problem Learning graph structure from nodal observations in data with uncertainty.
method Introduces novel iterations with independently interpretable parameters and Bayesian neural networks.
result Bayesian neural networks provide well-calibrated uncertainty quantification on graph structure.

Improved hypernetwork for efficient neural network hyperparameter tuning.

problem Efficiently optimizing hyperparameters in neural networks.
method Proposed ΔΔ-STN architecture focusing on accurate best-response Jacobian approximation.
result Significantly improved hyperparameter tuning accuracy and stability.

This work analyzes the convergence rate of unrolling for optimizing quadratic objectives.

problem The challenge of accurately computing Jacobians through optimization.
method Non-asymptotic convergence-rate analysis of unrolled differentiation for gradient descent and Chebyshev method.
result There is a trade-off between fast asymptotic convergence and immediate but slower convergence due to the learning rate.

Deep network improves electrical tomography across multiple frequencies.

problem Nonlinear multi-frequency electrical impedance tomography (mfEIT) for tissue conductivity estimation.
method Integrates graph neural networks (GNNs) into the iterative Proximal Regularized Gauss Newton (PRGN) framework to reconstruct tissue concentrations accurately.
result Accurate reconstruction of overlapping tissue fraction concentrations across multiple frequencies.

Neurally Augmented ALISTA improves sparse reconstruction performance.

problem Improving sparse reconstruction performance with theoretical guarantees and empirical improvements.
method Integrates an LSTM network to compute adaptive step sizes and thresholds for each target vector during reconstruction.
result Empirical performance is further improved, especially as compression ratios become more challenging.

OPT framework improves neural network generalization by learning an orthogonal transformation.

problem Improving neural network generalization.
method Orthogonal over-parameterized training (OPT) framework that minimizes hyperspherical energy.
result OPT framework provably minimizes hyperspherical energy and improves empirical generalization.

LUTNet optimizes FPGA for neural network inference, achieving high efficiency.

problem Redundancy in neural networks leads to inefficient hardware implementations.
method Exploits LUTs' flexibility for efficient neural network inference on FPGAs.
result Significant area savings with comparable accuracy compared to state-of-the-art binarized neural networks.

Paper presents an ADMM-based approach to efficiently integrate quadratic programming layers into neural networks.

problem Integrating quadratic programs into neural networks for optimization.
method An ADMM-based network layer architecture for solving quadratic programs efficiently.
result The ADMM layer is approximately an order of magnitude faster than existing methods for medium scaled problems.

Modified Hennings invariant defined using quantum groups and integrals.

problem Defining a modified Hennings invariant using quantum groups.
method Topological ribbon Hopf algebra, discrete Fourier transforms, symmetrized graded integral, modified trace.
result Modified graded Hennings invariant defined and extended to empty manifolds.

Framework for designing nonlinearities in neural networks with slope constraints.

problem Designing nonlinearities with specific properties for signal processing.
method Variational framework with regularization for slope constraints and optimization of adaptive splines.
result Adaptive nonuniform linear splines achieve global optimum in constrained optimization.

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…

2018-03-06abs ↗pdf ↗

E2Efold predicts RNA secondary structures better than previous methods.

problem RNA secondary structure prediction with constraints.
method End-to-end deep learning model using unrolled algorithms to enforce constraints.
result E2Efold predicts significantly better structures, especially for pseudoknotted structures.

New algorithm for online training of Spiking Neural Networks (SNNs).

problem Training Spiking Neural Networks (SNNs) online with BPTT-equivalent gradients.
method Clear separation of spatial and temporal gradient components, derived from biological insights.
result Online training of SNNs with BPTT-equivalent gradients and low time complexity.

L2GMOM learns financial networks and optimizes momentum strategies.

problem Expensive databases and financial expertise limit network construction accessibility.
method End-to-end machine learning framework (L2GMOM) that learns networks and optimizes trading signals.
result Significant improvement in portfolio profitability and risk control with Sharpe ratio of 1.74.

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…

2019-01-13abs ↗pdf ↗

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.