Dan Gutfreund

Orcid: 0000-0001-5101-4443

Affiliations:
  • IBM
  • Hebrew University of Jerusalem, Israel (former)


According to our database1, Dan Gutfreund authored at least 56 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
LInK: Learning Joint Representations of Design and Performance Spaces through Contrastive Learning for Mechanism Synthesis.
CoRR, 2024

A Graph per Persona: Reasoning about Subjective Natural Language Descriptions.
Proceedings of the Findings of the Association for Computational Linguistics, 2024

Visual Chain-of-Thought Prompting for Knowledge-Based Visual Reasoning.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Beyond Statistical Similarity: Rethinking Metrics for Deep Generative Models in Engineering Design.
Comput. Aided Des., December, 2023

Learning from Invalid Data: On Constraint Satisfaction in Generative Models.
CoRR, 2023

3D Neural Embedding Likelihood for Robust Sim-to-Real Transfer in Inverse Graphics.
CoRR, 2023

How hard are computer vision datasets? Calibrating dataset difficulty to viewing time.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

3D Neural Embedding Likelihood: Probabilistic Inverse Graphics for Robust 6D Pose Estimation.
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023

Zero-Shot Linear Combinations of Grounded Social Interactions with Linear Social MDPs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Multi-Moments in Time: Learning and Interpreting Models for Multi-Action Video Understanding.
IEEE Trans. Pattern Anal. Mach. Intell., 2022

LINKS: A dataset of a hundred million planar linkage mechanisms for data-driven kinematic design.
CoRR, 2022

Solving the Baby Intuitions Benchmark with a Hierarchically Bayesian Theory of Mind.
CoRR, 2022

Incorporating Rich Social Interactions Into MDPs.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022

The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark Towards Physically Realistic Embodied AI.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Finding Fallen Objects Via Asynchronous Audio-Visual Integration.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021
An autonomous debating system.
Nat., 2021

The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark for Physically Realistic Embodied AI.
CoRR, 2021

A Bayesian-Symbolic Approach to Reasoning and Learning in Intuitive Physics.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

3DP3: 3D Scene Perception via Probabilistic Programming.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021


AGENT: A Benchmark for Core Psychological Reasoning.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Moments in Time Dataset: One Million Videos for Event Understanding.
IEEE Trans. Pattern Anal. Mach. Intell., 2020

Template Controllable keywords-to-text Generation.
CoRR, 2020

Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modelling.
CoRR, 2020

ThreeDWorld: A Platform for Interactive Multi-Modal Physical Simulation.
CoRR, 2020

2019
SimVAE: Simulator-Assisted Training forInterpretable Generative Models.
CoRR, 2019

ObjectNet: A large-scale bias-controlled dataset for pushing the limits of object recognition models.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Reasoning About Human-Object Interactions Through Dual Attention Networks.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, 2019

Identifying Interpretable Action Concepts in Deep Networks.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2019

Grounding Spoken Words in Unlabeled Video.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2019

2018
Semantically Guided Visual Question Answering.
Proceedings of the 2018 IEEE Winter Conference on Applications of Computer Vision, 2018

2017
Boosting conditional probability estimators.
Ann. Math. Artif. Intell., 2017

2016
Automatic Arguments Construction - From Search Engine to Research Engine.
Proceedings of the 2016 AAAI Fall Symposia, Arlington, Virginia, USA, November 17-19, 2016, 2016

2014
Claims on demand - an initial demonstration of a system for automatic detection and polarity identification of context dependent claims in massive corpora.
Proceedings of the COLING 2014, 2014

A Benchmark Dataset for Automatic Detection of Claims and Evidence in the Context of Controversial Topics.
Proceedings of the First Workshop on Argument Mining, 2014

2013
Exploiting label dependencies for improved sample complexity.
Mach. Learn., 2013

Succinct Permanent Is <i>NEXP</i>-Hard with Many Hard Instances.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Succinct Permanent is NEXP-hard with Many Hard Instances.
Electron. Colloquium Comput. Complex., 2012

2011
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Comput. Complex., 2011

2010
On Approximating the Entropy of Polynomial Mappings.
Electron. Colloquium Comput. Complex., 2010

2009
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Electron. Colloquium Comput. Complex., 2009

2008
Limitations of Hardness vs. Randomness under Uniform Reductions.
Electron. Colloquium Comput. Complex., 2008

The Complexity of Local List Decoding.
Electron. Colloquium Comput. Complex., 2008

2007
A (De)constructive Approach to Program Checking.
Electron. Colloquium Comput. Complex., 2007

If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.
Comput. Complex., 2007

Verifying and decoding in constant depth.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Worst-Case to Average-Case Reductions Revisited.
Proceedings of the Approximation, 2007

2006
New connections between derandomization, worst-case complexity and average-case complexity.
Electron. Colloquium Comput. Complex., 2006

Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy.
Proceedings of the Approximation, 2006

2005
Derandomization, hard functions, and average-case complexity (דה-רנדומיזציה, פונקציות קשות וסיבוכיות ממוצעת.).
PhD thesis, 2005

2004
A lower bound for testing juntas.
Inf. Process. Lett., 2004

Fooling Parity Tests with Parity Gates
Electron. Colloquium Comput. Complex., 2004

2003
Trading Help for Interaction in Statistical Zero-Knowledge Proofs.
J. Cryptol., 2003

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games.
Comput. Complex., 2003

Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games.
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2000
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems.
Proceedings of the Advances in Cryptology, 2000


  Loading...