Fetching the paper…
Reading the bibliography…
Feature Learning aims to extract relevant information contained in data sets in an automated fashion.
Sufficiency and approximate sufficiency
Lucien Lecam · 1964
Earlier work this paper cites.
Statistical Isomorphism
Norman Morse and Richard Sacksteder · 1966
Earlier work this paper cites.
Probability of error, equivocation, and the Chernoff bound
Martin Hellman and Josef Raviv · 1970
Earlier work this paper cites.
A generalization of the rate-distortion theory and application
Moshe Zakai and Jacob Ziv · 1975
Earlier work this paper cites.
An application of the principle of maximum information preservation to linear systems
Ralph Linsker · 1989
Earlier work this paper cites.
Comparison of Statistical Experiments
Erik Torgersen · 1991
Earlier work this paper cites.
Conditioning as disintegration
Joseph T. Chang and David Pollard · 1997
Earlier work this paper cites.
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Bruno A. Olshausen and David J. Field · 1997
Earlier work this paper cites.
The information bottleneck method
Naftali Tishby, Fernando C. Pereira, and William Bialek · 1999
Earlier work this paper cites.
Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
Peter D. Grünwald and A. Philip Dawid · 2004
Earlier work this paper cites.
Clustering with Bregman divergences
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, and Joydeep Ghosh · 2005
Cited alongside, same era.
A survey of clustering data mining techniques
Pavel Berkhin · 2006
Cited alongside, same era.
Reducing the dimensionality of data with neural networks
Geoffrey E. Hinton and Ruslan R. Salakhutdinov · 2006
Cited alongside, same era.
The geometry of proper scoring rules
A. Phillip Dawid · 2007
Cited alongside, same era.
On the performance of clustering in Hilbert spaces
Gérard Biau, Luc Devroye, and Gábor Lugosi · 2008
Cited alongside, same era.
Differentiable sparse coding
David M Bradley and J Andrew Bagnell · 2008
Cited alongside, same era.
Generalization bounds for k-dimensional coding schemes in hilbert spaces
Unsupervised Kernel Dimension Reduction
Meihong Wang, Fei Sha, and Michael I Jordan · 2010
Later among the works it cites.
Kernel Bayes’ Rule
Kenji Fukumizu, L Song, and Arthur Gretton · 2011
Later among the works it cites.
Asymptotic Methods in Statistical Decision Theory
Lucien Lecam · 2011
Later among the works it cites.
Information, divergence and risk for binary experiments
Mark D. Reid and Robert C. Williamson · 2011
Later among the works it cites.
Elements of Information Theory
Thomas M. Cover and Jay A. Thomas · 2012
Later among the works it cites.
Task-driven dictionary learning
Julien Mairal, Francis Bach, and Jean Ponce · 2012
Later among the works it cites.
Proper local scoring rules
Matthew Parry, A Philip Dawid, and Steffen Lauritzen · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Andreas Maurer and Massimiliano Pontil · 2008
Cited alongside, same era.
Extracting and composing robust features with denoising autoencoders
Pascal Vincent, Hugo Larochelle, Yoshua Bengio, and Pierre-Antoine Manzagol · 2008
Cited alongside, same era.
Clustering: Science or art
Isabelle Guyon, Ulrike Von Luxburg, and Robert C Williamson · 2009
Cited alongside, same era.
Later among the works it cites.
Conditional measures and conditional expectation; Rohlin’s Disintegration Theorem
David Simmons · 2012
Later among the works it cites.
Generalized denoising auto-encoders as generative models
Yoshua Bengio, Li Yao, Guillaume Alain, and Pascal Vincent · 2013
Later among the works it cites.