Demo Data from EDBT 2026 / reviewers in the wild / expert
Hsiao-Yu Fish Tung
dblp:199/1661 · also Hsiao-Yu Tung
· DBLP profile ↗
18ranked-venue papers
7as first author
6since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 18 · 7 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorSystems, architecture and hardware · 1 · 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
15 papers |
3D vision · 37% Robot manipulation · 12% Video understanding and tracking · 9% | |
| Theoretical computer science
2 papers |
Algorithms and data structures · 100% | |
| Databases, data mining, and information retrieval
3 papers |
Information retrieval · 42% Data mining · 29% Data integration and cleaning · 22% |
Topics — the 30 heaviest of 50, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
3d scene understanding |
0.8 | 2 | 2020 | Embodied Language Grounding With 3D Visual Feature Representations · CVPR 2020 Learning Spatial Common Sense With Geometry-Aware Recurrent Networks · CVPR 2019 |
Computer vision › Vision and language › visual grounding
language grounding |
0.8 | 2 | 2020 | Embodied Language Grounding With 3D Visual Feature Representations · CVPR 2020 Reward Learning From Narrated Demonstrations · CVPR 2018 |
Robotics › Robot manipulation › grasping
articulated object manipulation |
0.7 | 1 | 2023 | H-SAUR: Hypothesize, Simulate, Act, Update, and Repeat for Understanding Object Articulations from Interactions · ICRA 2023 |
Computer vision › 3D vision
neural radiance field |
0.7 | 1 | 2023 | 3D-IntPhys: Towards More Generalized 3D-grounded Visual Intuitive Physics under Challenging Scenes · NeurIPS 2023 |
Computer vision › 3D vision › 3d scene understanding
physical scene understanding |
0.7 | 1 | 2023 | Physion++: Evaluating Physical Scene Understanding that Requires Online Inference of Different Physical Properties · NeurIPS 2023 |
Computer vision › Video understanding and tracking
video prediction |
0.7 | 1 | 2023 | 3D-IntPhys: Towards More Generalized 3D-grounded Visual Intuitive Physics under Challenging Scenes · NeurIPS 2023 |
Machine learning › Transfer learning and domain adaptation
meta-learning |
0.5 | 1 | 2021 | HyperDynamics: Meta-Learning Object and Agent Dynamics with Hypernetworks · ICLR 2021 |
Machine learning › Learning theory › classification › prototype-based classification
prototypical network |
0.5 | 1 | 2021 | Disentangling 3D Prototypical Networks for Few-Shot Concept Learning · ICLR 2021 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.4 | 1 | 2020 | Learning from Unlabelled Videos Using Contrastive Predictive Neural 3D Mapping · ICLR 2020 |
Computer vision › 3D vision
novel view synthesis |
0.4 | 1 | 2019 | Learning Spatial Common Sense With Geometry-Aware Recurrent Networks · CVPR 2019 |
Machine learning › Reinforcement learning
reward learning |
0.3 | 1 | 2018 | Reward Learning From Narrated Demonstrations · CVPR 2018 |
Computer vision › 3D vision
3d human pose estimation |
0.3 | 1 | 2017 | Adversarial Inverse Graphics Networks: Learning 2D-to-3D Lifting and Image-to-Image Translation from Unpaired Supervision · ICCV 2017 |
Machine learning › Generative modeling
generative model evaluation |
0.3 | 1 | 2017 | Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy · ICLR (Poster) 2017 |
Machine learning › Learning theory
hypothesis testing |
0.3 | 1 | 2017 | Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy · ICLR (Poster) 2017 |
Computer vision › 3D vision
inverse rendering |
0.3 | 1 | 2017 | Adversarial Inverse Graphics Networks: Learning 2D-to-3D Lifting and Image-to-Image Translation from Unpaired Supervision · ICCV 2017 |
Machine learning › Learning theory › probability metric › integral probability metric
maximum mean discrepancy |
0.3 | 1 | 2017 | Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy · ICLR (Poster) 2017 |
Machine learning › Probabilistic and Bayesian machine learning
model criticism |
0.3 | 1 | 2017 | Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy · ICLR (Poster) 2017 |
Computer vision › 3D vision › motion capture
monocular motion capture |
0.3 | 1 | 2017 | Self-supervised Learning of Motion Capture · NIPS 2017 |
Computer vision › 3D vision
motion capture |
0.3 | 1 | 2017 | Self-supervised Learning of Motion Capture · NIPS 2017 |
Data integration and cleaning
entity resolution |
0.2 | 1 | 2015 | Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013 · J. Mach. Learn. Res. 2015 |
Data mining
feature engineering |
0.2 | 1 | 2015 | Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013 · J. Mach. Learn. Res. 2015 |
Information retrieval › ranking
ranking model |
0.2 | 1 | 2015 | Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013 · J. Mach. Learn. Res. 2015 |
Algorithms and data structures › sketching
countsketch |
0.2 | 1 | 2015 | Fast and Guaranteed Tensor Decomposition via Sketching · NIPS 2015 |
Algorithms and data structures › numerical linear algebra › matrix and tensor decomposition › tensor decomposition
CP decomposition |
0.2 | 1 | 2015 | Fast and Guaranteed Tensor Decomposition via Sketching · NIPS 2015 |
Algorithms and data structures › numerical linear algebra
matrix and tensor decomposition |
0.2 | 1 | 2015 | Fast and Guaranteed Tensor Decomposition via Sketching · NIPS 2015 |
Algorithms and data structures
randomized algorithms |
0.2 | 1 | 2015 | Fast and Guaranteed Tensor Decomposition via Sketching · NIPS 2015 |
Algorithms and data structures
sketching |
0.2 | 1 | 2015 | Fast and Guaranteed Tensor Decomposition via Sketching · NIPS 2015 |
Algorithms and data structures › numerical linear algebra › matrix and tensor decomposition
tensor decomposition |
0.2 | 1 | 2015 | Fast and Guaranteed Tensor Decomposition via Sketching · NIPS 2015 |
Robotics › Motion planning and robot control
robot learning |
0.2 | 1 | 2023 | H-SAUR: Hypothesize, Simulate, Act, Update, and Repeat for Understanding Object Articulations from Interactions · ICRA 2023 |
Machine learning › Trustworthy machine learning
robustness |
0.2 | 1 | 2023 | Physion++: Evaluating Physical Scene Understanding that Requires Online Inference of Different Physical Properties · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.7relational inductive bias · 0.7reinforcement learning · 0.7probabilistic generative model · 0.7point-based dynamics prediction · 0.7physical prediction models · 0.7neural radiance field · 0.7learned vision prior · 0.7differentiable simulation · 0.7deep learning · 0.7tensor power iteration · 0.4colliding hashing · 0.4alternating least squares · 0.4FFT-based tensor contraction · 0.4learning to rank · 0.2feature engineering · 0.2countsketch · 0.2count sketch · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | FluidLab: A Differentiable Environment for Benchmarking Complex Fluid Manipulation
Zhou Xian, Zhenjia Xu, Hsiao-Yu Fish Tung, Antonio Torralba 0001, Katerina Fragkiadaki, Chuang Gan 0001 |
ICLR | 4 |
| 2023 | H-SAUR: Hypothesize, Simulate, Act, Update, and Repeat for Understanding Object Articulations from InteractionsabstractThe world is filled with articulated objects that are difficult to determine how to use from vision alone, e.g., a door might open inwards or outwards. Humans handle these objects with strategic trial-and-error: first pushing a door then pulling if that doesn't work. We enable these capabilities in autonomous agents by proposing “Hypothesize, Simulate, Act, Update, and Repeat” (H-SAUR), a probabilistic generative framework that simultaneously generates a distribution of hypotheses about how objects articulate given input observations, captures certainty over hypotheses over time, and infer plausible actions for exploration and goal-conditioned manipulation. We compare our model with existing work in manipulating objects after a handful of exploration actions, on the PartNet-Mobility dataset. We further propose a novel PuzzleBoxes benchmark that contains locked boxes that require multiple steps to solve. We show that the proposed model significantly outperforms the current state-of-the-art articulated object manipulation framework, despite using zero training data. We further improve the test-time efficiency of H-SAUR by integrating a learned prior from learning-based vision models. Kei Ota, Hsiao-Yu Fish Tung, Kevin A. Smith 0001, Anoop Cherian, Tim K. Marks, Alan Sullivan, Asako Kanezaki, Josh Tenenbaum |
ICRA | 2 |
| 2023 | Physion++: Evaluating Physical Scene Understanding that Requires Online Inference of Different Physical PropertiesabstractGeneral physical scene understanding requires more than simply localizing and recognizing objects -- it requires knowledge that objects can have different latent properties (e.g., mass or elasticity), and that those properties affect the outcome of physical events. While there has been great progress in physical and video prediction models in recent years, benchmarks to test their performance typically do not require an understanding that objects have individual physical properties, or at best test only those properties that are directly observable (e.g., size or color). This work proposes a novel dataset and benchmark, termed Physion++, that rigorously evaluates visual physical prediction in artificial systems under circumstances where those predictions rely on accurate estimates of the latent physical properties of objects in the scene. Specifically, we test scenarios where accurate prediction relies on estimates of properties such as mass, friction, elasticity, and deformability, and where the values of those properties can only be inferred by observing how objects move and interact with other objects or fluids. We evaluate the performance of a number of state-of-the-art prediction models that span a variety of levels of learning vs. built-in knowledge, and compare that performance to a set of human predictions. We find that models that have been trained using standard regimes and datasets do not spontaneously learn to make inferences about latent properties, but also that models that encode objectness and physical states tend to make better predictions. However, there is still a huge gap between all models and human performance, and all models' predictions correlate poorly with those made by humans, suggesting that no state-of-the-art model is learning to make physical predictions in a human-like way. These results show that current deep learning models that succeed in some settings nevertheless fail to achieve human-level physical prediction in other cases, especially those where latent property inference is required. Project page: https://dingmyu.github.io/physion_v2/ Hsiao-Yu Fish Tung, Mingyu Ding, Zhenfang Chen, Daniel Bear, Chuang Gan 0001, Josh Tenenbaum, Dan Yamins, Judith E. Fan, Kevin A. Smith 0001 |
NeurIPS | 1 |
| 2023 | 3D-IntPhys: Towards More Generalized 3D-grounded Visual Intuitive Physics under Challenging ScenesabstractGiven a visual scene, humans have strong intuitions about how a scene can evolve over time under given actions. The intuition, often termed visual intuitive physics, is a critical ability that allows us to make effective plans to manipulate the scene to achieve desired outcomes without relying on extensive trial and error. In this paper, we present a framework capable of learning 3D-grounded visual intuitive physics models from videos of complex scenes with fluids. Our method is composed of a conditional Neural Radiance Field (NeRF)-style visual frontend and a 3D point-based dynamics prediction backend, using which we can impose strong relational and structural inductive bias to capture the structure of the underlying environment. Unlike existing intuitive point-based dynamics works that rely on the supervision of dense point trajectory from simulators, we relax the requirements and only assume access to multi-view RGB images and (imperfect) instance masks acquired using color prior. This enables the proposed model to handle scenarios where accurate point estimation and tracking are hard or impossible. We generate datasets including three challenging scenarios involving fluid, granular materials, and rigid objects in the simulation. The datasets do not include any dense particle information so most previous 3D-based intuitive physics pipelines can barely deal with that. We show our model can make long-horizon future predictions by learning from raw images and significantly outperforms models that do not employ an explicit 3D representation space. We also show that once trained, our model can achieve strong generalization in complex scenarios under extrapolate settings. Antonio Torralba 0001, Josh Tenenbaum, Dan Yamins, Yunzhu Li, Hsiao-Yu Fish Tung |
NeurIPS | 6 |
| 2021 | Disentangling 3D Prototypical Networks for Few-Shot Concept Learning
Mihir Prabhudesai, Shamit Lal, Darshan Patil, Hsiao-Yu Fish Tung, Adam W. Harley, Katerina Fragkiadaki |
ICLR | 4 |
| 2021 | HyperDynamics: Meta-Learning Object and Agent Dynamics with Hypernetworks
Zhou Xian, Shamit Lal, Hsiao-Yu Fish Tung, Emmanouil A. Platanios, Katerina Fragkiadaki |
ICLR | 3 |
| 2020 | Embodied Language Grounding With 3D Visual Feature RepresentationsabstractWe propose associating language utterances to 3D visual abstractions of the scene they describe. The 3D visual abstractions are encoded as 3-dimensional visual feature maps. We infer these 3D visual scene feature maps from RGB images of the scene via view prediction: when the generated 3D scene feature map is neurally projected from a camera viewpoint, it should match the corresponding RGB image. We present generative models that condition on the dependency tree of an utterance and generate a corresponding visual 3D feature map as well as reason about its plausibility, and detector models that condition on both the dependency tree of an utterance and a related image and localize the object referents in the 3D feature map inferred from the image. Our model outperforms models of language and vision that associate language with 2D CNN activations or 2D images by a large margin in a variety of tasks, such as, classifying plausibility of utterances, detecting referential expressions, and supplying rewards for trajectory optimization of object placement policies from language instructions. We perform numerous ablations and show the improved performance of our detectors is due to its better generalization across camera viewpoints and lack of object interferences in the inferred 3D feature space, and the improved performance of our generators is due to their ability to spatially reason about objects and their configurations in 3D when mapping from language to scenes. Mihir Prabhudesai, Hsiao-Yu Fish Tung, Syed Ashar Javed, Maximilian Sieb, Adam W. Harley, Katerina Fragkiadaki |
CVPR | 2 |
| 2020 | Learning from Unlabelled Videos Using Contrastive Predictive Neural 3D Mapping
Adam W. Harley, Shrinidhi Kowshika Lakshmikanth, Hsiao-Yu Fish Tung, Katerina Fragkiadaki |
ICLR | 5 |
| 2019 | Learning Spatial Common Sense With Geometry-Aware Recurrent NetworksabstractWe integrate two powerful ideas, geometry and deep visual representation learning, into recurrent network architectures for mobile visual scene understanding. The proposed networks learn to “lift” 2D visual features and integrate them over time into latent 3D feature maps of the scene. They are equipped with differentiable geometric operations, such as projection, unprojection, egomotion estimation and stabilization, in order to compute a geometrically-consistent mapping between the world scene and their 3D latent feature space. We train the proposed architectures to predict novel image views given short frame sequences as input. Their predictions strongly generalize to scenes with a novel number of objects, appearances and configurations, and greatly outperform predictions of previous works that do not consider egomotion stabilization or a space-aware latent feature space. We train the proposed architectures to detect and segment objects in 3D, using the latent 3D feature map as input—as opposed to 2D feature maps computed from video frames. The resulting detections are permanent: they continue to exist even when an object gets occluded or leaves the field of view. Our experiments suggest the proposed space-aware latent feature arrangement and egomotion-stabilized convolutions are essential architectural choices for spatial common sense to emerge in artificial embodied visual agents. Hsiao-Yu Fish Tung, Ricson Cheng, Katerina Fragkiadaki |
CVPR | 1 |
| 2018 | Reward Learning From Narrated DemonstrationsabstractHumans effortlessly "program" one another by communicating goals and desires in natural language. In contrast, humans program robotic behaviours by indicating desired object locations and poses to be achieved [5], by providing RGB images of goal configurations [19], or supplying a demonstration to be imitated [17]. None of these methods generalize across environment variations, and they convey the goal in awkward technical terms. This work proposes joint learning of natural language grounding and instructable behavioural policies reinforced by perceptual detectors of natural language expressions, grounded to the sensory inputs of the robotic agent. Our supervision is narrated visual demonstrations (NVD), which are visual demonstrations paired with verbal narration (as opposed to being silent). We introduce a dataset of NVD where teachers perform activities while describing them in detail. We map the teachers' descriptions to perceptual reward detectors, and use them to train corresponding behavioural policies in simulation. We empirically show that our instructable agents (i) learn visual reward detectors using a small number of examples by exploiting hard negative mined configurations from demonstration dynamics, (ii) develop pick-and-place policies using learned visual reward detectors, (iii) benefit from object-factorized state representations that mimic the syntactic structure of natural language goal expressions, and (iv) can execute behaviours that involve novel objects in novel locations at test time, instructed by natural language. Hsiao-Yu Fish Tung, Adam W. Harley, Liang-Kang Huang, Katerina Fragkiadaki |
CVPR | 1 |
| 2017 | Adversarial Inverse Graphics Networks: Learning 2D-to-3D Lifting and Image-to-Image Translation from Unpaired SupervisionabstractResearchers have developed excellent feed-forward models that learn to map images to desired outputs, such as to the images’ latent factors, or to other images, using supervised learning. Learning such mappings from unlabelled data, or improving upon supervised models by exploiting unlabelled data, remains elusive. We argue that there are two important parts to learning without annotations: (i) matching the predictions to the input observations, and (ii) matching the predictions to known priors. We propose Adversarial Inverse Graphics networks (AIGNs): weakly supervised neural network models that combine feedback from rendering their predictions, with distribution matching between their predictions and a collection of ground-truth factors. We apply AIGNs to 3D human pose estimation and 3D structure and egomotion estimation, and outperform models supervised by only paired annotations. We further apply AIGNs to facial image transformation using super-resolution and inpainting renderers, while deliberately adding biases in the ground-truth datasets. Our model seamlessly incorporates such biases, rendering input faces towards young, old, feminine, masculine or Tom Cruiselike equivalents (depending on the chosen bias), or adding lip and nose augmentations while inpainting concealed lips and noses. Hsiao-Yu Fish Tung, Adam W. Harley, William Seto, Katerina Fragkiadaki |
ICCV | 1 |
| 2017 | Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy
Danica J. Sutherland, Hsiao-Yu Fish Tung, Heiko Strathmann, Soumyajit De, Aaditya Ramdas, Alexander J. Smola, Arthur Gretton |
ICLR (Poster) | 2 |
| 2017 | Self-supervised Learning of Motion CaptureabstractCurrent state-of-the-art solutions for motion capture from a single camera are optimization driven: they optimize the parameters of a 3D human model so that its re-projection matches measurements in the video (e.g. person segmentation, optical flow, keypoint detections etc.). Optimization models are susceptible to local minima. This has been the bottleneck that forced using clean green-screen like backgrounds at capture time, manual initialization, or switching to multiple cameras as input resource. In this work, we propose a learning based motion capture model for single camera input. Instead of optimizing mesh and skeleton parameters directly, our model optimizes neural network weights that predict 3D shape and skeleton configurations given a monocular RGB video. Our model is trained using a combination of strong supervision from synthetic data, and self-supervision from differentiable rendering of (a) skeletal keypoints, (b) dense 3D mesh motion, and (c) human-background segmentation, in an end-to-end framework. Empirically we show our model combines the best of both worlds of supervised learning and test-time optimization: supervised learning initializes the model parameters in the right regime, ensuring good pose and surface initialization at test time, without manual effort. Self-supervision by back-propagating through differentiable rendering allows (unsupervised) adaptation of the model to the test data, and offers much tighter fit than a pretrained fixed model. We show that the proposed model improves with experience and converges to low-error solutions where previous optimization methods fail. Hsiao-Yu Fish Tung, Hsiao-Wei Tung, Ersin Yumer, Katerina Fragkiadaki |
NIPS | 1 |
| 2015 | Fast and Guaranteed Tensor Decomposition via SketchingabstractTensor CANDECOMP/PARAFAC (CP) decomposition has wide applications in statistical learning of latent variable models and in data mining. In this paper, we propose fast and randomized tensor CP decomposition algorithms based on sketching. We build on the idea of count sketches, but introduce many novel ideas which are unique to tensors. We develop novel methods for randomized com- putation of tensor contractions via FFTs, without explicitly forming the tensors. Such tensor contractions are encountered in decomposition methods such as ten- sor power iterations and alternating least squares. We also design novel colliding hashes for symmetric tensors to further save time in computing the sketches. We then combine these sketching ideas with existing whitening and tensor power iter- ative techniques to obtain the fastest algorithm on both sparse and dense tensors. The quality of approximation under our method does not depend on properties such as sparsity, uniformity of elements, etc. We apply the method for topic mod- eling and obtain competitive results. Hsiao-Yu Fish Tung, Alexander J. Smola, Anima Anandkumar |
NIPS | 2 |
| 2015 | Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013
Chun-Liang Li, Yu-Chuan Su, Ting-Wei Lin, Cheng-Hao Tsai, Wei-Cheng Chang, Kuan-Hao Huang, Tzu-Ming Kuo, Shan-Wei Lin, Young-San Lin, Yu-Chen Lu, Chun-Pai Yang, Cheng-Xia Chang, Wei-Sheng Chin, Yu-Chin Juan, Hsiao-Yu Fish Tung, Jui-Pin Wang, Cheng-Kuang Wei, Felix Wu, Tu-Chun Yin, Tong Yu 0001, Yong Zhuang, Shou-De Lin, Hsuan-Tien Lin, Chih-Jen Lin |
J. Mach. Learn. Res. | 15 |
| 2014 | Novel traffic signal timing adjustment strategy based on Genetic AlgorithmabstractTraffic signal timing optimization problem aims at alleviating traffic congestion and shortening the average traffic time. However, most existing research considered only the information of one or few intersections at a time. Those local optimization methods may experience a decrease in performance when facing large-scale traffic networks. In this paper, we propose a cellular automaton traffic simulation system and conduct tests on two different optimization schemes. We use Genetic Algorithm (GA) for global optimization and Expectation Maximization (EM) as well as car flow for local optimization. Empirical results show that the GA method outperforms the EM method. Then, we use linear regression to learn from the global optimal solution obtained by GA and propose a new adjustment strategy that outperforms recent optimization methods. Hsiao-Yu Fish Tung, Wei-Chiu Ma, Tian-Li Yu 0001 |
IEEE Congress on Evolutionary Computation | 1 |
| 2014 | Spectral Methods for Indian Buffet Process Inference
Hsiao-Yu Fish Tung, Alexander J. Smola |
NIPS | 1 |
| 2014 | Effective string processing and matching for author disambiguation
Wei-Sheng Chin, Yong Zhuang, Yu-Chin Juan, Felix Wu, Hsiao-Yu Fish Tung, Tong Yu 0001, Jui-Pin Wang, Cheng-Xia Chang, Chun-Pai Yang, Wei-Cheng Chang, Kuan-Hao Huang, Tzu-Ming Kuo, Shan-Wei Lin, Young-San Lin, Yu-Chen Lu, Yu-Chuan Su, Cheng-Kuang Wei, Tu-Chun Yin, Chun-Liang Li, Ting-Wei Lin, Cheng-Hao Tsai, Shou-De Lin, Hsuan-Tien Lin, Chih-Jen Lin |
J. Mach. Learn. Res. | 5 |