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

Ofir Nabati

dblp:213/7912 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
4since 2021 · last 2025
0009-0008-1435-3399ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
4 papers
Reinforcement learning · 59% Generative modeling · 15% Trustworthy machine learning · 9%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 67% Image and video processing · 33%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › exploration
exploration-exploitation tradeoff
1.222023
Representation-Driven Reinforcement Learning · ICML 2023
Online Limited Memory Neural-Linear Bandits with Likelihood Matching · ICML 2021
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.912025
Preference Adaptive and Sequential Text-to-Image Generation · ICML 2025
Machine learning › Reinforcement learning
value-based reinforcement learning
0.912025
Preference Adaptive and Sequential Text-to-Image Generation · ICML 2025
Collaborative and social computing › collaborative design
co-creation
0.912025
Preference Adaptive and Sequential Text-to-Image Generation · ICML 2025
Image and video processing › video restoration
motion inpainting
0.812024
MaskedMimic: Unified Physics-Based Character Control Through Masked Motion Inpainting · ACM Trans. Graph. 2024
Computer animation and physical simulation
motion synthesis
0.812024
MaskedMimic: Unified Physics-Based Character Control Through Masked Motion Inpainting · ACM Trans. Graph. 2024
Computer animation and physical simulation › character control
physics-based character control
0.812024
MaskedMimic: Unified Physics-Based Character Control Through Masked Motion Inpainting · ACM Trans. Graph. 2024
Machine learning › Reinforcement learning › function approximation › representation learning for reinforcement learning
policy representation
0.712023
Representation-Driven Reinforcement Learning · ICML 2023
Machine learning › Learning paradigms › continual learning › catastrophic forgetting
catastrophic forgetting mitigation
0.512021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching · ICML 2021
Machine learning › Reinforcement learning › bandit
contextual bandit
0.512021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching · ICML 2021
Machine learning › Learning theory
online learning
0.512021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching · ICML 2021
Machine learning › Trustworthy machine learning
uncertainty estimation
0.512021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching · ICML 2021

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

reinforcement learning · 3.3large multimodal language model · 1.7expectation-maximization · 1.7motion tracking data · 1.5masked motion inpainting · 1.5policy gradient · 0.7evolutionary algorithm · 0.7contextual bandit · 0.7uncertainty estimation · 0.5likelihood matching · 0.5
YearPublicationVenuePosition
2025 Preference Adaptive and Sequential Text-to-Image Generation
abstract
We address the problem of interactive text-to-image (T2I) generation, designing a reinforcement learning (RL) agent which iteratively improves a set of generated images for a user through a sequence of prompt expansions. Using human raters, we create a novel dataset of sequential preferences, which we leverage, together with large-scale open-source (non-sequential) datasets. We construct user-preference and user-choice models using an EM strategy and identify varying user preference types. We then leverage a large multimodal language model (LMM) and a value-based RL approach to suggest an adaptive and diverse slate of prompt expansions to the user. Our Preference Adaptive and Sequential Text-to-image Agent (PASTA) extends T2I models with adaptive multi-turn capabilities, fostering collaborative co-creation and addressing uncertainty or underspecification in a user’s intent. We evaluate PASTA using human raters, showing significant improvement compared to baseline methods. We also open-source our sequential rater dataset and simulated user-rater interactions to support future research in user-centric multi-turn T2I systems.
Ofir Nabati, Guy Tennenholtz, Moonkyung Ryu, Deepak Ramachandran, Yinlam Chow, Craig Boutilier
ICML1
2024 MaskedMimic: Unified Physics-Based Character Control Through Masked Motion Inpainting
abstract
Crafting a single, versatile physics-based controller that can breathe life into interactive characters across a wide spectrum of scenarios represents an exciting frontier in character animation. An ideal controller should support diverse control modalities, such as sparse target keyframes, text instructions, and scene information. While previous works have proposed physically simulated, scene-aware control models, these systems have predominantly focused on developing controllers that each specializes in a narrow set of tasks and control modalities. This work presents MaskedMimic, a novel approach that formulates physics-based character control as a general motion inpainting problem. Our key insight is to train a single unified model to synthesize motions from partial (masked) motion descriptions, such as masked keyframes, objects, text descriptions, or any combination thereof. This is achieved by leveraging motion tracking data and designing a scalable training method that can effectively utilize diverse motion descriptions to produce coherent animations. Through this process, our approach learns a physics-based controller that provides an intuitive control interface without requiring tedious reward engineering for all behaviors of interest. The resulting controller supports a wide range of control modalities and enables seamless transitions between disparate tasks. By unifying character control through motion inpainting, MaskedMimic creates versatile virtual characters. These characters can dynamically adapt to complex scenes and compose diverse motions on demand, enabling more interactive and immersive experiences.
Chen Tessler, Yunrong Guo, Ofir Nabati, Gal Chechik, Xue Bin Peng
ACM Trans. Graph.3
2023 Representation-Driven Reinforcement Learning
abstract
We present a representation-driven framework for reinforcement learning. By representing policies as estimates of their expected values, we leverage techniques from contextual bandits to guide exploration and exploitation. Particularly, embedding a policy network into a linear feature space allows us to reframe the exploration-exploitation problem as a representation-exploitation problem, where good policy representations enable optimal exploration. We demonstrate the effectiveness of this framework through its application to evolutionary and policy gradient-based approaches, leading to significantly improved performance compared to traditional methods. Our framework provides a new perspective on reinforcement learning, highlighting the importance of policy representation in determining optimal exploration-exploitation strategies.
Ofir Nabati, Guy Tennenholtz, Shie Mannor
ICML1
2021 Online Limited Memory Neural-Linear Bandits with Likelihood Matching
abstract
We study neural-linear bandits for solving problems where {\em both} exploration and representation learning play an important role. Neural-linear bandits harnesses the representation power of Deep Neural Networks (DNNs) and combines it with efficient exploration mechanisms by leveraging uncertainty estimation of the model, designed for linear contextual bandits on top of the last hidden layer. In order to mitigate the problem of representation change during the process, new uncertainty estimations are computed using stored data from an unlimited buffer. Nevertheless, when the amount of stored data is limited, a phenomenon called catastrophic forgetting emerges. To alleviate this, we propose a likelihood matching algorithm that is resilient to catastrophic forgetting and is completely online. We applied our algorithm, Limited Memory Neural-Linear with Likelihood Matching (NeuralLinear-LiM2) on a variety of datasets and observed that our algorithm achieves comparable performance to the unlimited memory approach while exhibits resilience to catastrophic forgetting.
Ofir Nabati, Tom Zahavy, Shie Mannor
ICML1
2018 Fast and accurate reconstruction of compressed color light field
abstract
Light field photography has been studied thoroughly in recent years. One of its drawbacks is the need for multi-lens in the imaging. To compensate that, compressed light field photography has been proposed to tackle the trade-offs between the spatial and angular resolutions. It obtains by only one lens, a compressed version of the regular multi-lens system. The acquisition system consists of a dedicated hardware followed by a decompression algorithm, which usually suffers from high computational time. In this work, we propose a computationally efficient neural network that recovers a high-quality color light field from a single coded image. Unlike previous works, we compress the color channels as well, removing the need for a CFA in the imaging system. Our approach outperforms existing solutions in terms of recovery quality and computational complexity. We propose also a neural network for depth map extraction based on the decompressed light field, which is trained in an unsupervised manner without the ground truth depth map.
Ofir Nabati, David Mendlovic, Raja Giryes
ICCP1