Fetching the paper…
Reading the bibliography…
Learning-based binary hashing has become a powerful paradigm for fast search and retrieval in massive databases.
Bayesian conditionalisation and the principle of minimum information
P. M. Williams · 1980
Earlier work this paper cites.
Optimal Information Processing and Bayes’s Theorem
Arnold Zellner · 1988
Earlier work this paper cites.
Keeping the neural networks simple by minimizing the description length of the weights
Geoffrey E Hinton and Drew Van Camp · 1993
Earlier work this paper cites.
Autoencoders, minimum description length and helmholtz free energy
Geoffrey E Hinton and Richard S Zemel · 1994
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk and Rajeev Motwani · 1998
Earlier work this paper cites.
Similarity search in high dimensions via hashing
Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al · 1999
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
Charikar, Moses S · 2002
Earlier work this paper cites.
Distributions and operators , volume 252
Gerd Grubb · 2008
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
Spectral hashing
Yair Weiss, Antonio Torralba, and Rob Fergus · 2009
Earlier work this paper cites.
Modeling pixel means and covariances using factorized third-order boltzmann machines
Ranzato Marc’Aurelio and E Hinton Geoffrey · 2010
Earlier work this paper cites.
Semi-supervised hashing for scalable image retrieval
Jun Wang, Sanjiv Kumar, and Shih-Fu Chang · 2010
Earlier work this paper cites.
Iterative quantization: A procrustean approach to learning binary codes
Yunchao Gong and Svetlana Lazebnik · 2011
Earlier work this paper cites.
Product quantization for nearest neighbor search
Herve Jegou, Matthijs Douze, and Cordelia Schmid · 2011
Cited alongside, same era.
Hashing with graphs
Wei Liu, Jun Wang, Sanjiv Kumar, and Shih-Fu Chang · 2011
Cited alongside, same era.
Angular quantization-based binary codes for fast similarity search
Yunchao Gong, Sanjiv Kumar, Vishal Verma, and Svetlana Lazebnik · 2012
Cited alongside, same era.
Spherical hashing
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Chang, and Sung-Eui Yoon · 2012
Cited alongside, same era.
Estimating or propagating gradients through stochastic neurons for conditional computation
Yoshua Bengio, Nicholas Léonard, and Aaron Courville · 2013
Cited alongside, same era.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Neural variational inference and learning in belief networks
Andriy Mnih and Karol Gregor · 2014
Later among the works it cites.
Techniques for learning binary stochastic feedforward neural networks
Tapani Raiko, Mathias Berglund, Guillaume Alain, and Laurent Dinh · 2014
Later among the works it cites.
Hashing for similarity search: A survey
Jingdong Wang, Heng Tao Shen, Jingkuan Song, and Jianqiu Ji · 2014
Later among the works it cites.
Circulant binary embedding
Felix X Yu, Sanjiv Kumar, Yunchao Gong, and Shih-Fu Chang · 2014
Later among the works it cites.
Hashing with binary autoencoders
Miguel A Carreira-Perpinán and Ramin Raziperchikolaei · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Learning binary codes for high-dimensional data using bilinear projections
Yunchao Gong, Sanjiv Kumar, Henry A Rowley, and Svetlana Lazebnik · 2013
Cited alongside, same era.
K-means hashing: An affinity-preserving quantization method for learning binary compact codes
Kaiming He, Fang Wen, and Jian Sun · 2013
Cited alongside, same era.
Online hashing
Long-Kai Huang, Qiang Yang, and Wei-Shi Zheng · 2013
Cited alongside, same era.
Auto-encoding variational bayes
Diederik P Kingma and Max Welling · 2013
Cited alongside, same era.
Additive quantization for extreme vector compression
Babenko, Artem and Lempitsky, Victor · 2014
Cited alongside, same era.
Deep autoregressive networks
Karol Gregor, Ivo Danihelka, Andriy Mnih, Charles Blundell, and Daan Wierstra · 2014
Cited alongside, same era.
Shixiang Gu, Sergey Levine, Ilya Sutskever, and Andriy Mnih · 2015
Later among the works it cites.
Scalable Graph Hashing with Feature Transformation
Qing-Yuan Jiang and Wu-Jun Li · 2015
Later among the works it cites.
Online sketching hashing
Cong Leng, Jiaxiang Wu, Jian Cheng, Xiao Bai, and Hanqing Lu · 2015
Later among the works it cites.
Learning binary codes for maximum inner product search
Fumin Shen, Wei Liu, Shaoting Zhang, Yang Yang, and Heng Tao Shen · 2015
Later among the works it cites.
Optimization methods for large-scale machine learning
Léon Bottou, Frank E Curtis, and Jorge Nocedal · 2016
Later among the works it cites.
Provable bayesian inference via particle mirror descent
Bo Dai, Niao He, Hanjun Dai, and Le Song · 2016
Later among the works it cites.
Polysemous codes
Matthijs Douze, Hervé Jégou, and Florent Perronnin · 2016
Later among the works it cites.
Quantization based fast inner product search
Ruiqi Guo, Sanjiv Kumar, Krzysztof Choromanski, and David Simcha · 2016
Later among the works it cites.
Deep hashing network for efficient similarity retrieval
Han Zhu, Mingsheng Long, Jianmin Wang, and Yue Cao · 2016
Later among the works it cites.