中文
相关论文

相关论文: Eigendecomposition-Free Training of Deep Networks …

200 篇论文

Many successful deep learning architectures are equivariant to certain transformations in order to conserve parameters and improve generalization: most famously, convolution layers are equivariant to shifts of the input. This approach only…

机器学习 · 计算机科学 2021-03-31 Allan Zhou , Tom Knowles , Chelsea Finn

Deep neural networks have dramatically advanced the state of the art for many areas of machine learning. Recently they have been shown to have a remarkable ability to generate highly complex visual artifacts such as images and text rather…

计算机视觉与模式识别 · 计算机科学 2016-07-08 Andrey Zhmoginov , Mark Sandler

Tensor decomposition of high-dimensional data often struggles to capture semantically or physically meaningful structures, particularly when relying on reconstruction objectives and fixed-rank constraints. We introduce a no-rank tensor…

机器学习 · 计算机科学 2026-03-03 Maryam Bagherian

We introduce an unsupervised feature learning approach that embeds 3D shape information into a single-view image representation. The main idea is a self-supervised training objective that, given only a single 2D image, requires all unseen…

计算机视觉与模式识别 · 计算机科学 2018-08-01 Dinesh Jayaraman , Ruohan Gao , Kristen Grauman

The loss function of deep networks is known to be non-convex but the precise nature of this nonconvexity is still an active area of research. In this work, we study the loss landscape of deep networks through the eigendecompositions of…

机器学习 · 计算机科学 2019-02-08 Guillaume Alain , Nicolas Le Roux , Pierre-Antoine Manzagol

In this paper, we prove a conjecture published in 1989 and also partially address an open problem announced at the Conference on Learning Theory (COLT) 2015. With no unrealistic assumption, we first prove the following statements for the…

机器学习 · 统计学 2016-12-30 Kenji Kawaguchi

Deep learning and convolutional neural networks (ConvNets) have been successfully applied to most relevant tasks in the computer vision community. However, these networks are computationally demanding and not suitable for embedded devices…

计算机视觉与模式识别 · 计算机科学 2016-06-20 Jose Alvarez , Lars Petersson

Neural network training is usually accomplished by solving a non-convex optimization problem using stochastic gradient descent. Although one optimizes over the networks parameters, the main loss function generally only depends on the…

机器学习 · 计算机科学 2023-02-10 Julius Berner , Dennis Elbrächter , Philipp Grohs

A significant weakness of most current deep Convolutional Neural Networks is the need to train them using vast amounts of manu- ally labelled data. In this work we propose a unsupervised framework to learn a deep convolutional neural…

计算机视觉与模式识别 · 计算机科学 2016-08-01 Ravi Garg , Vijay Kumar BG , Gustavo Carneiro , Ian Reid

When optimizing over-parameterized models, such as deep neural networks, a large set of parameters can achieve zero training error. In such cases, the choice of the optimization algorithm and its respective hyper-parameters introduces…

机器学习 · 计算机科学 2019-12-06 Gauthier Gidel , Francis Bach , Simon Lacoste-Julien

Un-trained convolutional neural networks have emerged as highly successful tools for image recovery and restoration. They are capable of solving standard inverse problems such as denoising and compressive sensing with excellent results by…

机器学习 · 计算机科学 2020-05-11 Reinhard Heckel , Mahdi Soltanolkotabi

Inverse rendering is the problem of decomposing an image into its intrinsic components, i.e. albedo, normal and lighting. To solve this ill-posed problem from single image, state-of-the-art methods in shape from shading mostly resort to…

计算机视觉与模式识别 · 计算机科学 2021-06-30 Mona Zehni , Shaona Ghosh , Krishna Sridhar , Sethu Raman

We propose a sparse reconstruction framework (aNETT) for solving inverse problems. Opposed to existing sparse reconstruction techniques that are based on linear sparsifying transforms, we train an autoencoder network $D \circ E$ with $E$…

数值分析 · 数学 2020-04-22 Daniel Obmann , Linh Nguyen , Johannes Schwab , Markus Haltmeier

Employing deep neural networks as natural image priors to solve inverse problems either requires large amounts of data to sufficiently train expressive generative models or can succeed with no data via untrained neural networks. However,…

机器学习 · 计算机科学 2019-10-25 Oscar Leong , Wesam Sakla

In this paper, the problem of decentralized eigenvalue decomposition of a general symmetric matrix that is important, e.g., in Principal Component Analysis, is studied, and a decentralized online learning algorithm is proposed. Instead of…

信号处理 · 电气工程与系统科学 2023-08-14 Yufan Fan , Minh Trinh-Hoang , Cemil Emre Ardic , Marius Pesavento

Compressive sensing is a method to recover the original image from undersampled measurements. In order to overcome the ill-posedness of this inverse problem, image priors are used such as sparsity in the wavelet domain, minimum…

计算机视觉与模式识别 · 计算机科学 2018-12-20 Magauiya Zhussip , Shakarim Soltanayev , Se Young Chun

While deep learning is successful in a number of applications, it is not yet well understood theoretically. A satisfactory theoretical characterization of deep learning however, is beginning to emerge. It covers the following questions: 1)…

机器学习 · 计算机科学 2019-08-27 Tomaso Poggio , Andrzej Banburski , Qianli Liao

Recent years have witnessed the great advance of deep learning in a variety of vision tasks. Many state-of-the-art deep neural networks suffer from large size and high complexity, which makes it difficult to deploy in resource-limited…

计算机视觉与模式识别 · 计算机科学 2019-05-29 Zhengguang Zhou , Wengang Zhou , Xutao Lv , Xuan Huang , Xiaoyu Wang , Houqiang Li

Intrinsic image decomposition is the classical task of mapping image to albedo. The WHDR dataset allows methods to be evaluated by comparing predictions to human judgements ("lighter", "same as", "darker"). The best modern intrinsic image…

计算机视觉与模式识别 · 计算机科学 2020-11-23 D. A. Forsyth , Jason J. Rock

We introduce a "learning-based" algorithm for the low-rank decomposition problem: given an $n \times d$ matrix $A$, and a parameter $k$, compute a rank-$k$ matrix $A'$ that minimizes the approximation loss $\|A-A'\|_F$. The algorithm uses a…

机器学习 · 计算机科学 2019-10-31 Piotr Indyk , Ali Vakilian , Yang Yuan