paper-with-me

Papers

SGD-Net: Efficient Model-Based Deep Learning with Theoretical Guarantees

2021-01-22 · Jiaming Liu, Yu Sun, Weijie Gan, Xiaojian Xu, Brendt Wohlberg, Ulugbek S. Kamilov

Deep unfolding networks have recently gained popularity in the context of solving imaging inverse problems. However, the computational and memory complexity of data-consistency layers within traditional deep unfolding networks scales with the number of measurements, limiting their applicability to large-scale imaging inverse problems. We propose SGD-Net as a new methodology for improving the efficiency of deep unfolding through stochastic approximations of the data-consistency layers. Our theoretical analysis shows that SGD-Net can be trained to approximate batch deep unfolding networks to an arbitrary precision. Our numerical results on intensity diffraction tomography and sparse-view computed tomography show that SGD-Net can match the performance of the batch network at a fraction of training and testing complexity.

📄 PDF Abstract BibTeX arXiv:2101.09379

Code (1)

odlgroup/odl 공식 구현

Tasks

Deep Learning

Similar Papers 제목 키워드 기반

Denoising guarantees for optimized sampling schemes in compressed sensing

2025-04-01 · Yaniv Plan, Matthew S. Scott, Xia Sheng, Ozgur Yilmaz

Compressed sensing with subsampled unitary matrices benefits from \emph{optimized} sampling schemes, which feature improved theoretical guarantees and empirical performance relative to uniform subsampling. We provide, in…

compressed sensingDenoising

Machine Learning with Guarantees using Descriptive Complexity and SMT Solvers

2016-09-09 · Charles Jordan, Łukasz Kaiser

Machine learning is a thriving part of computer science. There are many efficient approaches to machine learning that do not provide strong theoretical guarantees, and a beautiful general learning theory. Unfortunately, …

BIG-bench Machine LearningBoard GamesDescriptiveLearning Theory

Algorithms for ridge estimation with convergence guarantees

2021-04-26 · Wanli Qiao, Wolfgang Polonik

The extraction of filamentary structure from a point cloud is discussed. The filaments are modeled as ridge lines or higher dimensional ridges of an underlying density. We propose two novel algorithms, and provide theore…

AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration

2022-12-01 · Jasmin Brandt, Elias Schede, Viktor Bengs, Björn Haddenhorst 외

We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter configuration of a given target algorithm in an automated way. Recently, there has been significant progress in designing…

Multi-Armed Bandits

Guarantees for Greedy Maximization of Non-submodular Functions with Applications

2017-03-06 · ICML 2017 8 · Andrew An Bian, Joachim M. Buhmann, Andreas Krause, Sebastian Tschiatschek

We investigate the performance of the standard Greedy algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theoretical guarantees on the performance of …

Experimental Design