Search Results for author: Forest Agostinelli

Found 10 papers, 2 papers with code

On Solving the Rubik's Cube with Domain-Independent Planners Using Standard Representations

no code implementations25 Jul 2023 Bharath Muppasani, Vishal Pallagani, Biplav Srivastava, Forest Agostinelli

The fastest solver today for RC is DeepCubeA with a custom representation, and another approach is with Scorpion planner with State-Action-Space+ (SAS+) representation.

Rubik's Cube

Independent Modular Networks

no code implementations2 Jun 2023 Hamed Damirchi, Forest Agostinelli, Pooyan Jamshidi

However, a lack of structure in each module's role, and modular network-specific issues such as module collapse have restricted their usability.

A* Search Without Expansions: Learning Heuristic Functions with Deep Q-Networks

no code implementations8 Feb 2021 Forest Agostinelli, Alexander Shmakov, Stephen Mcaleer, Roy Fox, Pierre Baldi

We use Q* search to solve the Rubik's cube when formulated with a large action space that includes 1872 meta-actions and find that this 157-fold increase in the size of the action space incurs less than a 4-fold increase in computation time and less than a 3-fold increase in number of nodes generated when performing Q* search.

Rubik's Cube

SPLASH: Learnable Activation Functions for Improving Accuracy and Adversarial Robustness

no code implementations16 Jun 2020 Mohammadamin Tavakoli, Forest Agostinelli, Pierre Baldi

Furthermore, we show that SPLASH units significantly increase the robustness of deep neural networks to adversarial attacks.

Adversarial Robustness

Symmetric-APL Activations: Training Insights and Robustness to Adversarial Attacks

no code implementations25 Sep 2019 Mohammadamin Tavakoli, Forest Agostinelli, Pierre Baldi

Finally, we show that the use of Symmetric-APL activations can significantly increase the robustness of deep neural networks to adversarial attacks.

Solving the Rubik's Cube with Approximate Policy Iteration

no code implementations ICLR 2019 Stephen McAleer, Forest Agostinelli, Alexander Shmakov, Pierre Baldi

Autodidactic Iteration is able to learn how to solve the Rubik’s Cube and the 15-puzzle without relying on human data.

Rubik's Cube

Solving the Rubik's Cube Without Human Knowledge

9 code implementations18 May 2018 Stephen McAleer, Forest Agostinelli, Alexander Shmakov, Pierre Baldi

A generally intelligent agent must be able to teach itself how to solve problems in complex domains with minimal human supervision.

Combinatorial Optimization reinforcement-learning +2

Adaptive Multi-Column Deep Neural Networks with Application to Robust Image Denoising

no code implementations NeurIPS 2013 Forest Agostinelli, Michael R. Anderson, Honglak Lee

Stacked sparse denoising auto-encoders (SSDAs) have recently been shown to be successful at removing noise from corrupted images.

Image Denoising

Cannot find the paper you are looking for? You can Submit a new open access paper.