Fetching the paper…
Reading the bibliography…
Neural random fields (NRFs), referring to a class of generative models that use neural networks to implement potential functions in random fields (a.k.a.
H. Robbins and S. Monro, “A stochastic approximation method,” The Annals of Mathematical Statistics , pp. 400–407, 1951
1951
Earlier work this paper cites.
J. Besag, “Statistical analysis of non-lattice data,” Journal of the Royal Statistical Society: Series D (The Statistician) , vol. 24, no. 3, pp. 179–195, 1975
1975
Earlier work this paper cites.
L. Younes, “Parametric inference for imperfectly observed gibbsian fields,” Probability Theory and Related Fields , vol. 82, pp. 625–645, 1989
1989
Earlier work this paper cites.
G. E. Hinton, P. Dayan, B. J. Frey, and R. M. Neal, “The "wake-sleep" algorithm for unsupervised neural networks.” Science , vol. 268, no. 5214, pp. 1158–1161, 1995
1995
Earlier work this paper cites.
A. P. Bradley, “The use of the area under the ROC curve in the evaluation of machine learning algorithms,” Pattern recognition , vol. 30, no. 7, pp. 1145–1159, 1997
1997
Earlier work this paper cites.
Y. Chen, X. S. Zhou, and T. S. Huang, “One-class SVM for learning in image retrieval,” in International Conference on Image Processing , 2001
2001
Earlier work this paper cites.
G. Hinton, “Training products of experts by minimizing contrastive divergence,” Neural computation , vol. 14, pp. 1771–1800, 2002
2002
Earlier work this paper cites.
Y. W. Teh, M. Welling, S. Osindero, and G. E. Hinton, “Energy-based models for sparse overcomplete representations,” Journal of Machine Learning Research , vol. 4, no. Dec, pp. 1235–1260, 2003
2003
Earlier work this paper cites.
D. M. Tax and R. P. Duin, “Support vector data description,” Machine learning , vol. 54, no. 1, pp. 45–66, 2004
2004
Earlier work this paper cites.
B. J. Frey and N. Jojic, “A comparison of algorithms for inference and learning in probabilistic graphical models,” IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI) , vol. 27, no. 9, pp. 1392–1416, 2005
2005
Earlier work this paper cites.
M. A. Carreira-Perpinan and G. E. Hinton, “On contrastive divergence learning.” in AISTATS , 2005
2005
Earlier work this paper cites.
A. Hyvärinen, “Estimation of non-normalized statistical models by score matching,” Journal of Machine Learning Research , vol. 6, no. Apr, pp. 695–709, 2005
2005
Earlier work this paper cites.
Y. LeCun, S. Chopra, R. Hadsell, M. Ranzato, and F. Huang, “A tutorial on energy-based learning,” Predicting structured data , 2006
2006
Earlier work this paper cites.
Y. Altun and A. Smola, “Unifying divergence minimization and statistical inference via convex duality,” in International Conference on Computational Learning Theory , 2006
2006
Earlier work this paper cites.
C. Andrieu and J. Thoms, “A tutorial on adaptive mcmc,” Statistics and computing , vol. 18, no. 4, pp. 343–373, 2008
2008
Earlier work this paper cites.
T. Tieleman, “Training restricted Boltzmann machines using approximations to the likelihood gradient,” in ICML , 2008
2008
Earlier work this paper cites.
D. Koller and N. Friedman, Probabilistic graphical models: principles and techniques . MIT press, 2009
2009
Earlier work this paper cites.
G. O. Roberts and J. S. Rosenthal, “Examples of adaptive mcmc,” Journal of Computational and Graphical Statistics , vol. 18, no. 2, pp. 349–367, 2009
2009
Earlier work this paper cites.
A. Krizhevsky, “Learning multiple layers of features from tiny images,” Technical report, University of Toronto , 2009
2009
Earlier work this paper cites.
T. Artieres et al. , “Neural conditional random fields,” in AISTATS , 2010
2010
Earlier work this paper cites.
R. M. Neal, “MCMC using Hamiltonian dynamics,” Handbook of Markov Chain Monte Carlo , 2011
2011
Earlier work this paper cites.
M. Welling and Y. W. Teh, “Bayesian learning via stochastic gradient Langevin dynamics,” in ICML , 2011
2011
Earlier work this paper cites.
J. Sohl-Dickstein, P. Battaglino, and M. R. DeWeese, “Minimum probability flow learning,” in ICML , 2011
2011
Earlier work this paper cites.
J. Ngiam, Z. Chen, W. K. Pang, and A. Y. Ng, “Learning deep energy models,” in ICML , 2012
2012
Earlier work this paper cites.
M. U. Gutmann and A. Hyvärinen, “Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics,” Journal of Machine Learning Research , vol. 13, no. Feb, pp. 307–361, 2012
2012
Cited alongside, same era.
M. Lichman et al. , “UCI machine learning repository,” 2013. [Online]. Available: http://archive.ics.uci.edu/ml
2013
Cited alongside, same era.
D. P. Kingma and M. Welling, “Auto-encoding variational Bayes,” in ICLR , 2014
2014
Cited alongside, same era.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in NIPS , 2014
2014
Cited alongside, same era.
T. Chen, E. Fox, and C. Guestrin, “Stochastic gradient Hamiltonian Monte Carlo,” in ICML , 2014
2014
Cited alongside, same era.
M. Arjovsky, S. Chintala, and L. Bottou, “Wasserstein generative adversarial networks,” in ICML , 2017
2017
Later among the works it cites.
C.-L. Li, W.-C. Chang, Y. Cheng, Y. Yang, and B. Póczos, “Mmd gan: Towards deeper understanding of moment matching network,” in NIPS , 2017
2017
Later among the works it cites.
I. Gulrajani, F. Ahmed, M. Arjovsky, V. Dumoulin, and A. C. Courville, “Improved training of wasserstein GANs,” in NIPS , 2017
2017
Later among the works it cites.
V. Dumoulin, I. Belghazi, B. Poole, O. Mastropietro, A. Lamb, M. Arjovsky, and A. Courville, “Adversarially learned inference,” in ICLR , 2017
2017
Later among the works it cites.
M. Heusel, H. Ramsauer, T. Unterthiner, B. Nessler, and S. Hochreiter, “GANs trained by a two time-scale update rule converge to a local nash equilibrium,” in NIPS , 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. D. Zeiler and R. Fergus, “Visualizing and understanding convolutional networks,” in European conference on computer vision , 2014
2014
Cited alongside, same era.
I. Sato and H. Nakagawa, “Approximation analysis of stochastic gradient langevin dynamics by using fokker-planck equation and ito process,” in ICML , 2014
2014
Cited alongside, same era.
S. Zheng, S. Jayasumana, B. Romera-Paredes, V. Vineet, Z. Su, D. Du, C. Huang, and P. H. Torr, “Conditional random fields as recurrent neural networks,” in ICCV , 2015
2015
Cited alongside, same era.
Y.-A. Ma, T. Chen, and E. Fox, “A complete recipe for stochastic gradient mcmc,” in NIPS , 2015
2015
Cited alongside, same era.
J. Bornschein and Y. Bengio, “Reweighted wake-sleep,” in ICML , 2015
2015
Cited alongside, same era.
2015
Cited alongside, same era.
S. Nowozin, B. Cseke, and R. Tomioka, “f-GAN: Training generative neural samplers using variational divergence minimization,” in NIPS , 2016
2016
Cited alongside, same era.
Y. Mroueh and T. Sercu, “Fisher GAN,” in NIPS , 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
J. Xie, Y. Lu, R. Gao, S.-C. Zhu, and Y. N. Wu, “Cooperative training of descriptor and generator networks,” IEEE transactions on pattern analysis and machine intelligence , vol. 42, no. 1, pp. 27–45, 2018
2018
Closest in time.
B. Wang and Z. Ou, “Improved training of neural trans-dimensional random field language models with dynamic noise-contrastive estimation,” in 2018 IEEE Spoken Language Technology Workshop (SLT) . IEEE, 2018
2018
Closest in time.
D. Levy, M. D. Hoffman, and J. Sohl-Dickstein, “Generalizing Hamiltonian Monte Carlo with neural networks,” in ICLR , 2018
2018
Closest in time.
2018
Closest in time.
L. Ruff, N. Görnitz, L. Deecke, S. A. Siddiqui, R. Vandermeulen, A. Binder, E. Müller, and M. Kloft, “Deep one-class classification,” in ICML , 2018
2018
Closest in time.
B. Zong, Q. Song, M. R. Min, W. Cheng, C. Lumezanu, D. Cho, and H. Chen, “Deep autoencoding gaussian mixture model for unsupervised anomaly detection,” in ICLR , 2018
2018
Closest in time.
C.-S. F. B. L. Houssam Zenati, Manon Romain and V. Chandrasekhar, “Adversarially learned anomaly detection,” in International Conference on Data Mining , 2018
2018
Closest in time.
T. Miyato, T. Kataoka, M. Koyama, and Y. Yoshida, “Spectral normalization for generative adversarial networks,” in ICLR , 2018
2018
Closest in time.
X. Wei, Z. Liu, L. Wang, and B. Gong, “Improving the improved training of wasserstein GANs,” in ICLR , 2018
2018
Closest in time.
J. Adler and S. Lunz, “Banach wasserstein gan,” in NIPS , 2018
2018
Closest in time.
K. Hu, Z. Ou, M. Hu, and J. Feng, “Neural crf transducers for sequence labeling,” in ICASSP , 2019
2019
Closest in time.
2019
Closest in time.
Y. Song and S. Ermon, “Generative modeling by estimating gradients of the data distribution,” in NIPS , 2019
2019
Closest in time.
T. Han, E. Nijkamp, X. Fang, M. Hill, S.-C. Zhu, and Y. N. Wu, “Divergence triangle for joint training of generator model, energy-based model, and inferential model,” in CVPR , 2019
2019
Closest in time.
R. Habib and D. Barber, “Auxiliary variational mcmc,” in ICLR , 2019
2019
Closest in time.
B. Dai, H. Dai, A. Gretton, L. Song, D. Schuurmans, and N. He, “Kernel exponential family estimation via doubly dual embedding,” in AISTATS , 2019
2019
Closest in time.