Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,980,284 papers from all fields of science
Search
Sign In
Create Free Account
Gradient descent
Known as:
Descent
, Gradient descent optimization
, Gradient descent method
Expand
Gradient descent is a first-order iterative optimization algorithm. To find a local minimum of a function using gradient descent, one takes steps…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AdaBoost
Backpropagation
Boltzmann machine
Conditional random field
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
An ensemble learning strategy for graph clustering
Michael Ovelgönne
,
A. Geyer-Schulz
Graph Partitioning and Graph Clustering
2012
Corpus ID: 6557851
This paper is on a graph clustering scheme inspired by ensemble learning. In short, the idea of ensemble learning is to learn…
Expand
Highly Cited
2011
Highly Cited
2011
A real-time 1080p 2D-to-3D video conversion system
Sung-Fang Tsai
,
Chao-Chung Cheng
,
Chung-Te Li
,
Liang-Gee Chen
IEEE transactions on consumer electronics
2011
Corpus ID: 229112
In this paper, we demonstrate a 2D-to-3D video conversion system capable of real-time 1920×1080p conversion. The proposed system…
Expand
Highly Cited
2005
Highly Cited
2005
Inpainting the colors
G. Sapiro
IEEE International Conference on Image Processing
2005
Corpus ID: 16579734
A framework for automatic image colorization, the art of adding color to a monochrome image or movie, is presented in this paper…
Expand
Highly Cited
2002
Highly Cited
2002
A 100×100 pixel silicon retina for gradient extraction with steering filter capabilities and temporal output coding
M. Barbaro
,
Pierre-Yves Burgi
,
A. Mortara
,
P. Nussbaum
,
F. Heitger
IEEE J. Solid State Circuits
2002
Corpus ID: 16683291
A 100/spl times/100 pixel analog very large scale integration retina is proposed to extract the magnitude and direction of…
Expand
Highly Cited
2001
Highly Cited
2001
Three-dimensional subsurface analysis of electromagnetic scattering from penetrable/PEC objects buried under rough surfaces: use of the steepest descent fast multipole method
M. El-Shenawee
,
C. Rappaport
,
E. Miller
,
M. Silevitch
IEEE Transactions on Geoscience and Remote…
2001
Corpus ID: 2886083
The electromagnetic scattering from a three-dimensional (3D) shallow object buried under a two-dimensional (2D) random rough…
Expand
Highly Cited
2000
Highly Cited
2000
A matrix-algebraic approach to linear parallel interference cancellation in CDMA
Dongning Guo
,
L. Rasmussen
,
Sumei Sun
,
Teng Joon Lim
IEEE Transactions on Communications
2000
Corpus ID: 8331029
Linear parallel interference cancellation (PIC) schemes are described and analyzed using matrix algebra. It is shown that the…
Expand
Highly Cited
1994
Highly Cited
1994
A hybrid algorithm for finding the global minimum of error function of neural networks and its applications
N. Baba
,
Y. Mogami
,
Motokazu Kohzaki
,
Y. Shiraishi
,
Yutaka Yoshida
Neural Networks
1994
Corpus ID: 37941990
Highly Cited
1985
Highly Cited
1985
Fast algorithms for lpdeconvolution
R. Yarlagadda
,
J. Bednar
,
T. Watt
IEEE Transactions on Acoustics Speech and Signal…
1985
Corpus ID: 39702532
This paper discusses two algorithms for l_{p}, 1 \leq p \leq 2 , deconvolution. One, iterative reweighted least squares (IRLS…
Expand
Highly Cited
1980
Highly Cited
1980
Motion-compensated coding: Some new results
A. Netravali
,
J. D. Robbins
Bell Labs technical journal
1980
Corpus ID: 13325024
In earlier papers, we have presented motion-compensated television coding schemes in which the displacement of objects was…
Expand
Review
1945
Review
1945
THE DETERMINATION OF SERUM PROTEIN CONCENTRATION WITH A GRADIENT TUBE
O. H. Lowry
,
T. Hunter
1945
Corpus ID: 82796498
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE