Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ari Weinstein

dblp:05/9799 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Legged, aerial and field robots · 38% Motion planning and robot control · 19% Reinforcement learning · 19%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
cross-entropy optimization
0.212013
The Cross-Entropy Method Optimizes for Quantiles · ICML (3) 2013
Robotics › Legged, aerial and field robots › legged robots
humanoid locomotion
0.212013
Open-Loop Planning in Large-Scale Stochastic Domains · AAAI 2013
Robotics › Legged, aerial and field robots › legged robots
legged robot locomotion
0.212013
Open-Loop Planning in Large-Scale Stochastic Domains · AAAI 2013
Machine learning › Reinforcement learning
policy search
0.212013
The Cross-Entropy Method Optimizes for Quantiles · ICML (3) 2013
Robotics › Motion planning and robot control › motion planning
sampling-based motion planning
0.212013
Open-Loop Planning in Large-Scale Stochastic Domains · AAAI 2013
Mathematical optimization › stochastic optimization
cross-entropy method
0.212013
The Cross-Entropy Method Optimizes for Quantiles · ICML (3) 2013
Mathematical optimization
stochastic optimization
0.212013
The Cross-Entropy Method Optimizes for Quantiles · ICML (3) 2013
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
probabilistic planning
0.012013
Open-Loop Planning in Large-Scale Stochastic Domains · AAAI 2013

Methods — techniques the papers use, named apart from their topics

quantile optimization · 0.3cross-entropy method · 0.3sample-based planning · 0.2receding horizon planning · 0.2cross-entropy optimization · 0.2
YearPublicationVenuePosition
2017 Structure Learning in Motor Control: A Deep Reinforcement Learning Model
Ari Weinstein, Matt M. Botvinick
CogSci1
2013 Open-Loop Planning in Large-Scale Stochastic Domains
abstract
We focus on effective sample-based planning in the face of underactuation, high-dimensionality, drift, discrete system changes, and stochasticity. These are hallmark challenges for important problems, such as humanoid locomotion. In order to ensure broad applicability, we assume domain expertise is minimal and limited to a generative model. In order to make the method responsive, computational costs that scale linearly with the amount of samples taken from the generative model are required. We bring to bear a concrete method that satisfies all these requirements; it is a receding-horizon open-loop planner that employs cross-entropy optimization for policy construction. In simulation, we empirically demonstrate near-optimal decisions in a small domain and effective locomotion in several challenging humanoid control tasks.
Ari Weinstein, Michael L. Littman
AAAI1
2013 The Cross-Entropy Method Optimizes for Quantiles
abstract
Cross-entropy optimization (CE) has proven to be a powerful tool for search in control environments. In the basic scheme, a distribution over proposed solutions is repeatedly adapted by evaluating a sample of solutions and refocusing the distribution on a percentage of those with the highest scores. We show that, in the kind of noisy evaluation environments that are common in decision-making domains, this percentage-based refocusing does not optimize the expected utility of solutions, but instead a quantile metric. We provide a variant of CE (Proportional CE) that effectively optimizes the expected value. We show using variants of established noisy environments that Proportional CE can be used in place of CE and can improve solution quality.
Sergiu Goschin, Ari Weinstein, Michael L. Littman
ICML (3)2
2011 Perception of intentions and mental states in autonomous virtual agents
Peter C. Pantelis, Steven A. Cholewiak, Paul Ringstad, Kevin Sanik, Ari Weinstein, Chia-Chien Wu, Jacob Feldman
CogSci5