Rithvik Terence Dsouza
Research Subjects
Research Interests
Rithvik Terence Dsouza has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Omatharv Bharat Vaidya
BITS Pilani K.K. Birla Goa Campus
2 shared publications - Snehanshu Saha
CSIS and APPCAIR, Birla Institute of Technology and Science Pilani Goa Campus, Zuarinagar, Goa, India
2 shared publications - Soma S. Dhavala
Director-ML Wadhwani AI Bengaluru India
2 shared publications - Swagatam Das
Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, West Bengal, India
2 shared publications
Latest Publications
- 13 April 2023
- Published by Springer Nature
- p. 212-223
HMC-PSO: A Hamiltonian Monte Carlo and Particle Swarm Optimization-Based Optimizer
- 13 April 2023
- Published by Springer Nature
- p. 212-223
HMC-PSO: A Hamiltonian Monte Carlo and Particle Swarm Optimization-Based Optimizer
- Open Access
Hamiltonian Monte Carlo Particle Swarm Optimizer
We introduce the Hamiltonian Monte Carlo Particle Swarm Optimizer (HMC-PSO), an optimization algorithm that reaps the benefits of both Exponentially Averaged Momentum PSO and HMC sampling. The coupling of the position and velocity of each particle with Hamiltonian dynamics in the simulation allows for extensive freedom for exploration and exploitation of the search space. It also provides an excellent technique to explore highly non-convex functions while ensuring efficient sampling. We extend the method to approximate error gradients in closed form for Deep Neural Network (DNN) settings. We discuss possible methods of coupling and compare its performance to that of state-of-the-art optimizers on the Golomb's Ruler problem and Classification tasks.
Open AccessHamiltonian Monte Carlo Particle Swarm Optimizer
We introduce the Hamiltonian Monte Carlo Particle Swarm Optimizer (HMC-PSO), an optimization algorithm that reaps the benefits of both Exponentially Averaged Momentum PSO and HMC sampling. The coupling of the position and velocity of each particle with Hamiltonian dynamics in the simulation allows for extensive freedom for exploration and exploitation of the search space. It also provides an excellent technique to explore highly non-convex functions while ensuring efficient sampling. We extend the method to approximate error gradients in closed form for Deep Neural Network (DNN) settings. We discuss possible methods of coupling and compare its performance to that of state-of-the-art optimizers on the Golomb's Ruler problem and Classification tasks.