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

Dimitris Papadimitriou

dblp:213/6940 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

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
1 paper
Reinforcement learning · 75% Motion planning and robot control · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › imitation learning › inverse reinforcement learning
constraint inference
0.812024
Bayesian Constraint Inference from User Demonstrations Based on Margin-Respecting Preference Models · ICRA 2024
Machine learning › Reinforcement learning › imitation learning
inverse reinforcement learning
0.812024
Bayesian Constraint Inference from User Demonstrations Based on Margin-Respecting Preference Models · ICRA 2024
Machine learning › Reinforcement learning
preference learning
0.812024
Bayesian Constraint Inference from User Demonstrations Based on Margin-Respecting Preference Models · ICRA 2024
Robotics › Motion planning and robot control
robot learning
0.812024
Bayesian Constraint Inference from User Demonstrations Based on Margin-Respecting Preference Models · ICRA 2024

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

preference modeling · 0.8bayesian inference · 0.8
YearPublicationVenuePosition
2024 Bayesian Constraint Inference from User Demonstrations Based on Margin-Respecting Preference Models
abstract
It is crucial for robots to be aware of the presence of constraints in order to acquire safe policies. However, explicitly specifying all constraints in an environment can be a challenging task. State-of-the-art constraint inference algorithms learn constraints from demonstrations, but tend to be computationally expensive and prone to instability issues. In this paper, we propose a novel Bayesian method that infers constraints based on preferences over demonstrations. The main advantages of our proposed approach are that it 1) infers constraints without calculating a new policy at each iteration, 2) uses a simple and more realistic ranking of groups of demonstrations, without requiring pairwise comparisons over all demonstrations, and 3) adapts to cases where there are varying levels of constraint violation. Our empirical results demonstrate that our proposed Bayesian approach infers constraints of varying severity, more accurately than state-of-the-art constraint inference methods. Code and videos: https://sites.google.com/berkeley.edu/pbicrl.
Dimitris Papadimitriou, Daniel S. Brown
ICRA1
2021 Data-Driven Low-Rank Neural Network Compression
abstract
Despite many modern applications of Deep Neural Networks (DNNs), the large number of parameters in the hidden layers makes them unattractive for deployment on devices with storage capacity constraints. In this paper we propose a Data-Driven Low-rank (DDLR) method to reduce the number of parameters of pretrained DNNs and expedite inference by imposing low-rank structure on the fully connected layers, while controlling for the overall accuracy and without requiring any retraining. We pose the problem as finding the lowest rank approximation of each fully connected layer with given performance guarantees and relax it to a tractable convex optimization problem. We show that it is possible to significantly reduce the number of parameters in common DNN architectures with only a small reduction in classification accuracy. We compare DDLR with Net-Trim, which is another data-driven DNN compression technique based on sparsity and show that DDLR consistently produces more compressed neural networks while maintaining higher accuracy.
Dimitris Papadimitriou, Swayambhoo Jain
ICIP1