Fetching the paper…
Reading the bibliography…
We propose a new class of structured methods for Monte Carlo (MC) sampling, called DPPMC, designed for high-dimensional nonisotropic distributions where samples are correlated to reduce the variance of the estimator via determinantal point processes.
Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (cma-es)
N. Hansen, S. D. Müller, and P. Koumoutsakos · 2003
Earlier work this paper cites.
Eynardmehta theorem, schur process, and their pfaffian analogs
A. Borodin and E. Rains · 2005
Earlier work this paper cites.
Random features for large-scale kernel machines
A. Rahimi and B. Recht · 2007
Earlier work this paper cites.
A sparse Johnson-Lindenstrauss transform
A. Dasgupta, R. Kumar, and T. Sarlós · 2010
Earlier work this paper cites.
An almost optimal unrestricted fast Johnson-Lindenstrauss transform
N. Ailon and E. Liberty · 2011
Earlier work this paper cites.
k-dpps: Fixed-size determinantal point processes
A. Kulesza and B. Taskar · 2011
Earlier work this paper cites.
The numpy array: a structure for efficient numerical computation
S. Van Der Walt, S. C. Colbert, and G. Varoquaux · 2011
Earlier work this paper cites.
Theoretical foundation for CMA-ES from information geometry perspective
Y. Akimoto, Y. Nagata, I. Ono, and S. Kobayashi · 2012
Earlier work this paper cites.
Determinantal point processes for machine learning
A. Kulesza and B. Taskar · 2012
Earlier work this paper cites.
Fast determinantal point process sampling with application to clustering
B. Kang · 2013
Earlier work this paper cites.
Gaussian process kernels for pattern discovery and extrapolation
A. G. Wilson and R. P. Adams · 2013
Earlier work this paper cites.
Density-preserving quantization with application to graph downsampling
M. Alamgir, G. Lugosi, and U. Luxburg · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
D. P. Kingma and J. Ba · 2014
Earlier work this paper cites.
Uniform Distribution and Quasi-Monte Carlo Methods - Discrepancy, Integration and Applications
P. Kritzer, H. Niederreiter, F. Pillichshammer, and A. Winterhof, editors · 2014
Earlier work this paper cites.
Quasi-monte carlo feature maps for shift-invariant kernels
J. Yang, V. Sindhwani, H. Avron, and M. W. Mahoney · 2014
Cited alongside, same era.
Distributed submodular cover: Succinctly summarizing massive data
B. Mirzasoleiman, A. Karbasi, A. Badanidiyuru, and A. Krause · 2015
Cited alongside, same era.
Y.-L. K. Samo and S. J. Roberts · 2015
Cited alongside, same era.
Sampling from determinantal point processes for scalable manifold learning
C. Wachinger and P. Golland · 2015
Cited alongside, same era.
Quasi-Monte Carlo feature maps for shift-invariant kernels
H. Avron, V. Sindhwani, J. Yang, and M. W. Mahoney · 2016
Cited alongside, same era.
Monte carlo with determinantal point processes
R. Bardenet and A. Hardy · 2016
Non-stationary spectral kernels
S. Remes, M. Heinonen, and S. Kaski · 2017
Later among the works it cites.
Evolution strategies as a scalable alternative to reinforcement learning
T. Salimans, J. Ho, X. Chen, S. Sidor, and I. Sutskever · 2017
Later among the works it cites.
CMA-ES and advanced adaptation mechanisms
Y. Akimoto and N. Hansen · 2018
Later among the works it cites.
Initialization matters: Orthogonal predictive state recurrent neural networks
K. Choromanski, C. Downey, B. Boots, D. Holtmann-Rice, and S. Kumar · 2018
Later among the works it cites.
The geometry of random features
K. Choromanski, M. Rowland, T. Sarlos, V. Sindhwani, R. Turner, and A. Weller · 2018
Later among the works it cites.
Structured evolution with compact architectures for scalable policy optimization
K. Choromanski, M. Rowland, V. Sindhwani, R. E. Turner, and A. Weller · 2018
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.
G. Brockman, V. Cheung, L. Pettersson, J. Schneider, J. Schulman, J. Tang, and W. Zaremba · 2016
Cited alongside, same era.
Benchmarking deep reinforcement learning for continuous control
Y. Duan, X. Chen, R. Houthooft, J. Schulman, and P. Abbeel · 2016
Cited alongside, same era.
Efficient sampling for k-determinantal point processes
C. Li, S. Jegelka, and S. Sra · 2016
Cited alongside, same era.
Fast DPP sampling for nystrom with application to kernel methods
C. Li, S. Jegelka, and S. Sra · 2016
Cited alongside, same era.
Diversity networks
Z. Mariet and S. Sra · 2016
Cited alongside, same era.
Orthogonal random features
F. Yu, A. Suresh, K. Choromanski, D. Holtmann-Rice, and S. Kumar · 2016
Cited alongside, same era.
Simple random search provides a competitive approach to reinforcement learning
H. Mania, A. Guy, and B. Recht · 2018
Later among the works it cites.
Geometrically coupled monte carlo sampling
M. Rowland, K. Choromanski, F. Chalus, A. Pacchiano, T. Sarlós, R. E. Turner, and A. Weller · 2018
Later among the works it cites.
Nevergrad: An open source tool for derivative-free optimization
O. Teytaud and J. Rapin · 2018
Later among the works it cites.
K. Choromanski, A. Pacchiano, J. Parker-Holder, J. Hsu, A. Iscen, D. Jain, and V. Sindhwani · 2019
Closest in time.
Kama-nns: low-dimenaional rotation-based neural networks
K. Choromanski, A. Pacchiano, J. Pennington, and Y. Tang · 2019
Closest in time.
Guided evolutionary strategies: augmenting random search with surrogate gradients
N. Maheswaranathan, L. Metz, G. Tucker, D. Choi, and J. Sohl-Dickstein · 2019
Closest in time.
Orthogonal estimation of wasserstein distances
M. Rowland, J. Hron, Y. Tang, K. Choromanski, T. Sarlos, and A. Weller · 2019
Closest in time.