VLDB 2026 Research / reviewers in the wild / expert
Di Chen 0001
dblp:12/414-1
· DBLP profile ↗
10ranked-venue papers
5as first author
2since 2021 · last 2022
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 10 · 5 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-author · 1 since 2021Software engineering, systems software and programming languages · 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
7 papers |
Probabilistic and Bayesian machine learning · 27% Deep learning architectures and training · 17% Trustworthy machine learning · 17% | |
| Interdisciplinary, comprehensive, and emerging computing
8 papers |
Environmental and earth informatics · 50% Computational finance and economics · 26% Computational science and engineering · 16% | |
| Computer graphics and multimedia
2 papers |
Image and video processing · 60% Audio and music processing · 40% |
Topics — the 23 heaviest of 29, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Environmental and earth informatics
remote sensing |
0.6 | 1 | 2022 | Monitoring Vegetation From Space at Extremely Fine Resolutions via Coarsely-Supervised Smooth U-Net · IJCAI 2022 |
Environmental and earth informatics › ecological monitoring
vegetation monitoring |
0.6 | 1 | 2022 | Monitoring Vegetation From Space at Extremely Fine Resolutions via Coarsely-Supervised Smooth U-Net · IJCAI 2022 |
Image and video processing › super-resolution
image super-resolution |
0.6 | 1 | 2022 | Monitoring Vegetation From Space at Extremely Fine Resolutions via Coarsely-Supervised Smooth U-Net · IJCAI 2022 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint satisfaction
constraint-based reasoning |
0.4 | 1 | 2020 | Deep Reasoning Networks for Unsupervised Pattern De-mixing with Constraint Reasoning · ICML 2020 |
Machine learning › Deep learning architectures and training › loss function design
surrogate loss learning |
0.4 | 1 | 2020 | Task-Based Learning via Task-Oriented Prediction Network with Applications in Finance · IJCAI 2020 |
Robotics › Motion planning and robot control › robot learning
task learning |
0.4 | 1 | 2020 | Task-Based Learning via Task-Oriented Prediction Network with Applications in Finance · IJCAI 2020 |
Computational finance and economics › credit risk
credit risk modeling |
0.4 | 1 | 2020 | Task-Based Learning via Task-Oriented Prediction Network with Applications in Finance · IJCAI 2020 |
Computational finance and economics
financial forecasting |
0.4 | 1 | 2020 | Task-Based Learning via Task-Oriented Prediction Network with Applications in Finance · IJCAI 2020 |
Computational science and engineering
materials science |
0.4 | 1 | 2020 | Deep Reasoning Networks for Unsupervised Pattern De-mixing with Constraint Reasoning · ICML 2020 |
Machine learning › Trustworthy machine learning › robustness
dataset bias mitigation |
0.4 | 1 | 2019 | Bias Reduction via End-to-End Shift Learning: Application to Citizen Science · AAAI 2019 |
Machine learning › Trustworthy machine learning
robustness |
0.4 | 1 | 2019 | Bias Reduction via End-to-End Shift Learning: Application to Citizen Science · AAAI 2019 |
Machine learning › Generative modeling › variational autoencoder
conditional variational autoencoder |
0.3 | 1 | 2018 | Multi-Entity Dependence Learning With Rich Context via Conditional Variational Auto-Encoder · AAAI 2018 |
Machine learning › Deep learning architectures and training › neural network training
end-to-end learning |
0.3 | 1 | 2018 | End-to-End Learning for the Deep Multivariate Probit Model · ICML 2018 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models |
0.3 | 1 | 2018 | Multi-Entity Dependence Learning With Rich Context via Conditional Variational Auto-Encoder · AAAI 2018 |
Machine learning › Generative modeling
variational autoencoder |
0.3 | 1 | 2018 | Multi-Entity Dependence Learning With Rich Context via Conditional Variational Auto-Encoder · AAAI 2018 |
Environmental and earth informatics › ecological modeling
species distribution modeling |
0.3 | 1 | 2017 | Deep Multi-species Embedding · IJCAI 2017 |
Machine learning › Learning paradigms
unsupervised learning |
0.1 | 1 | 2020 | Deep Reasoning Networks for Unsupervised Pattern De-mixing with Constraint Reasoning · ICML 2020 |
Environmental and earth informatics
biodiversity monitoring |
0.1 | 1 | 2019 | Automatic Detection and Compression for Passive Acoustic Monitoring of the African Forest Elephant · AAAI 2019 |
Computational social science and digital humanities
citizen science data |
0.1 | 1 | 2019 | Bias Reduction via End-to-End Shift Learning: Application to Citizen Science · AAAI 2019 |
Environmental and earth informatics › conservation
wildlife conservation |
0.1 | 1 | 2019 | Automatic Detection and Compression for Passive Acoustic Monitoring of the African Forest Elephant · AAAI 2019 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo |
0.1 | 1 | 2018 | End-to-End Learning for the Deep Multivariate Probit Model · ICML 2018 |
Computational science and engineering
computational sustainability |
0.1 | 1 | 2018 | Multi-Entity Dependence Learning With Rich Context via Conditional Variational Auto-Encoder · AAAI 2018 |
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
deep embedding |
0.1 | 1 | 2017 | Deep Multi-species Embedding · IJCAI 2017 |
Methods — techniques the papers use, named apart from their topics
deep learning · 1.6deep neural network · 1.6u-net · 1.1smoothness regularization · 1.1convolutional neural network · 1.1surrogate loss · 0.9stochastic gradient descent · 0.9multivariate log-normal distribution · 0.9end-to-end gradient-based training · 0.9constraint reasoning · 0.9multivariate probit model · 0.4reweighting · 0.4end-to-end learning · 0.4differentiable compression · 0.4crowdsourcing · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Monitoring Vegetation From Space at Extremely Fine Resolutions via Coarsely-Supervised Smooth U-NetabstractMonitoring vegetation productivity at extremely fine resolutions is valuable for real-world agricultural applications, such as detecting crop stress and providing early warning of food insecurity. Solar-Induced Chlorophyll Fluorescence (SIF) provides a promising way to directly measure plant productivity from space. However, satellite SIF observations are only available at a coarse spatial resolution, making it impossible to monitor how individual crop types or farms are doing. This poses a challenging coarsely-supervised regression (or downscaling) task; at training time, we only have SIF labels at a coarse resolution (3km), but we want to predict SIF at much finer spatial resolutions (e.g. 30m, a 100x increase). We also have additional fine-resolution input features, but the relationship between these features and SIF is unknown. To address this, we propose Coarsely-Supervised Smooth U-Net (CS-SUNet), a novel method for this coarse supervision setting. CS-SUNet combines the expressive power of deep convolutional networks with novel regularization methods based on prior knowledge (such as a smoothness loss) that are crucial for preventing overfitting. Experiments show that CS-SUNet resolves fine-grained variations in SIF more accurately than existing methods. Joshua Fan 0002, Di Chen 0001, Jiaming Wen 0002, Ying Sun 0011, Carla P. Gomes |
IJCAI | 2 |
| 2021 | CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial GamesabstractWe introduce a curriculum learning framework for challenging tasks that require a combination of pattern recognition and combinatorial reasoning, such as single-player visual combinatorial games. Our work harnesses Deep Reasoning Nets (DRNets) [Chen et al., 2020], a framework that combines deep learning with constraint reasoning for unsupervised pattern demixing. We propose CLR-DRNets (pronounced Clear-DRNets), a curriculum-learning-with-restarts framework to boost the performance of DRNets. CLR-DRNets incrementally increase the difficulty of the training instances and use restarts, a new model selection method that selects multiple models from the same training trajectory to learn a set of diverse heuristics and apply them at inference time. An enhanced reasoning module is also proposed for CLR-DRNets to improve the ability of reasoning and generalize to unseen instances. We consider Visual Sudoku, i.e., Sudoku with hand-written digits or letters, and Visual Mixed Sudoku, a substantially more challenging task that requires the demixing and completion of two overlapping Visual Sudokus. We propose an enhanced reasoning module for the DRNets framework for encoding these visual games We show how CLR-DRNets considerably outperform DRNets and other approaches on these visual combinatorial games. Yiwei Bai, Di Chen 0001, Carla P. Gomes |
CP | 2 |
| 2020 | Deep Reasoning Networks for Unsupervised Pattern De-mixing with Constraint ReasoningabstractWe introduce Deep Reasoning Networks (DRNets), an end-to-end framework that combines deep learning with constraint reasoning for solving pattern de-mixing problems, typically in an unsupervised or very-weakly-supervised setting. DRNets exploit problem structure and prior knowledge by tightly combining constraint reasoning with stochastic-gradient-based neural network optimization. Our motivating task is from materials discovery and concerns inferring crystal structures of materials from X-ray diffraction data (Crystal-Structure-Phase-Mapping). Given the complexity of its underlying scientific domain, we start by introducing DRNets on an analogous but much simpler task: de-mixing overlapping hand-written Sudokus (Multi-MNIST-Sudoku). On Multi-MNIST-Sudoku, DRNets almost perfectly recovered the mixed Sudokus’ digits, with 100% digit accuracy, outperforming the supervised state-of-the-art MNIST de-mixing models. On Crystal-Structure-Phase-Mapping, DRNets significantly outperform the state of the art and experts’ capabilities, recovering more precise and physically meaningful crystal structures. Di Chen 0001, Yiwei Bai, Wenting Zhao 0002, Sebastian Ament, John M. Gregoire, Carla P. Gomes |
ICML | 1 |
| 2020 | Task-Based Learning via Task-Oriented Prediction Network with Applications in FinanceabstractReal-world applications often involve domain-specific and task-based performance objectives that are not captured by the standard machine learning losses, but are critical for decision making. A key challenge for direct integration of more meaningful domain and task-based evaluation criteria into an end-to-end gradient-based training process is the fact that often such performance objectives are not necessarily differentiable and may even require additional decision-making optimization processing. We propose the Task-Oriented Prediction Network (TOPNet), an end-to-end learning scheme that automatically integrates task-based evaluation criteria into the learning process via a learnable surrogate loss function, which directly guides the model towards the task-based goal. A major benefit of the proposed TOPNet learning scheme lies in its capability of automatically integrating non-differentiable evaluation criteria, which makes it particularly suitable for diversified and customized task-based evaluation criteria in real-world tasks. We validate the performance of TOPNet on two real-world financial prediction tasks, revenue surprise forecasting and credit risk modeling. The experimental results demonstrate that TOPNet significantly outperforms both traditional modeling with standard losses and modeling with hand-crafted heuristic differentiable surrogate losses. Di Chen 0001, Yada Zhu, Carla P. Gomes |
IJCAI | 1 |
| 2020 | Deep Hurdle Networks for Zero-Inflated Multi-Target Regression: Application to Multiple Species Abundance EstimationabstractA key problem in computational sustainability is to understand the distribution of species across landscapes over time. This question gives rise to challenging large-scale prediction problems since (i) hundreds of species have to be simultaneously modeled and (ii) the survey data are usually inflated with zeros due to the absence of species for a large number of sites. The problem of tackling both issues simultaneously, which we refer to as the zero-inflated multi-target regression problem, has not been addressed by previous methods in statistics and machine learning. In this paper, we propose a novel deep model for the zero-inflated multi-target regression problem. To this end, we first model the joint distribution of multiple response variables as a multivariate probit model and then couple the positive outcomes with a multivariate log-normal distribution. By penalizing the difference between the two distributions’ covariance matrices, a link between both distributions is established. The whole model is cast as an end-to-end learning framework and we provide an efficient learning algorithm for our model that can be fully implemented on GPUs. We show that our model outperforms the existing state-of-the-art baselines on two challenging real-world species distribution datasets concerning bird and fish populations. Shufeng Kong, Junwen Bai, Jae Hee Lee 0001, Di Chen 0001, Andrew Allyn, Michelle Stuart, Malin Pinsky, Katherine Mills, Carla P. Gomes |
IJCAI | 4 |
| 2019 | Automatic Detection and Compression for Passive Acoustic Monitoring of the African Forest ElephantabstractIn this work, we consider applying machine learning to the analysis and compression of audio signals in the context of monitoring elephants in sub-Saharan Africa. Earth’s biodiversity is increasingly under threat by sources of anthropogenic change (e.g. resource extraction, land use change, and climate change) and surveying animal populations is critical for developing conservation strategies. However, manually monitoring tropical forests or deep oceans is intractable. For species that communicate acoustically, researchers have argued for placing audio recorders in the habitats as a costeffective and non-invasive method, a strategy known as passive acoustic monitoring (PAM). In collaboration with conservation efforts, we construct a large labeled dataset of passive acoustic recordings of the African Forest Elephant via crowdsourcing, compromising thousands of hours of recordings in the wild. Using state-of-the-art techniques in artificial intelligence we improve upon previously proposed methods for passive acoustic monitoring for classification and segmentation. In real-time detection of elephant calls, network bandwidth quickly becomes a bottleneck and efficient ways to compress the data are needed. Most audio compression schemes are aimed at human listeners and are unsuitable for low-frequency elephant calls. To remedy this, we provide a novel end-to-end differentiable method for compression of audio signals that can be adapted to acoustic monitoring of any species and dramatically improves over naive coding strategies. Johan Bjorck, Brendan Rappazzo, Di Chen 0001, Richard Bernstein, Peter H. Wrege, Carla P. Gomes |
AAAI | 3 |
| 2019 | Bias Reduction via End-to-End Shift Learning: Application to Citizen ScienceabstractCitizen science projects are successful at gathering rich datasets for various applications. However, the data collected by citizen scientists are often biased — in particular, aligned more with the citizens’ preferences than with scientific objectives. We propose the Shift Compensation Network (SCN), an end-to-end learning scheme which learns the shift from the scientific objectives to the biased data while compensating for the shift by re-weighting the training data. Applied to bird observational data from the citizen science project eBird, we demonstrate how SCN quantifies the data distribution shift and outperforms supervised learning models that do not address the data bias. Compared with competing models in the context of covariate shift, we further demonstrate the advantage of SCN in both its effectiveness and its capability of handling massive high-dimensional data. Di Chen 0001, Carla P. Gomes |
AAAI | 1 |
| 2018 | Multi-Entity Dependence Learning With Rich Context via Conditional Variational Auto-EncoderabstractMulti-Entity Dependence Learning (MEDL) explores conditional correlations among multiple entities. The availability of rich contextual information requires a nimble learning scheme that tightly integrates with deep neural networks and has the ability to capture correlation structures among exponentially many outcomes. We propose MEDL_CVAE, which encodes a conditional multivariate distribution as a generating process. As a result, the variational lower bound of the joint likelihood can be optimized via a conditional variational auto-encoder and trained end-to-end on GPUs. Our MEDL_CVAE was motivated by two real-world applications in computational sustainability: one studies the spatial correlation among multiple bird species using the eBird data and the other models multi-dimensional landscape composition and human footprint in the Amazon rainforest with satellite images. We show that MEDL_CVAE captures rich dependency structures, scales better than previous methods, and further improves on the joint likelihood taking advantage of very large datasets that are beyond the capacity of previous methods. Luming Tang, Yexiang Xue, Di Chen 0001, Carla P. Gomes |
AAAI | 3 |
| 2018 | End-to-End Learning for the Deep Multivariate Probit ModelabstractThe multivariate probit model (MVP) is a popular classic model for studying binary responses of multiple entities. Nevertheless, the computational challenge of learning the MVP model, given that its likelihood involves integrating over a multidimensional constrained space of latent variables, significantly limits its application in practice. We propose a flexible deep generalization of the classic MVP, the Deep Multivariate Probit Model (DMVP), which is an end-to-end learning scheme that uses an efficient parallel sampling process of the multivariate probit model to exploit GPU-boosted deep neural networks. We present both theoretical and empirical analysis of the convergence behavior of DMVP’s sampling process with respect to the resolution of the correlation structure. We provide convergence guarantees for DMVP and our empirical analysis demonstrates the advantages of DMVP’s sampling compared with standard MCMC-based methods. We also show that when applied to multi-entity modelling problems, which are natural DMVP applications, DMVP trains faster than classical MVP, by at least an order of magnitude, captures rich correlations among entities, and further improves the joint likelihood of entities compared with several competitive models. Di Chen 0001, Yexiang Xue, Carla P. Gomes |
ICML | 1 |
| 2017 | Deep Multi-species EmbeddingabstractUnderstanding how species are distributed across landscapes over time is a fundamental question in biodiversity research. Unfortunately, most species distribution models only target a single species at a time, despite strong ecological evidence that species are not independently distributed. We propose Deep Multi-Species Embedding (DMSE), which jointly embeds vectors corresponding to multiple species as well as vectors representing environmental covariates into a common high-dimensional feature space via a deep neural network. Applied to bird observational data from the citizen science project eBird, we demonstrate how the DMSE model discovers inter-species relationships to outperform single-species distribution models (random forests and SVMs) as well as competing multi-label models. Additionally, we demonstrate the benefit of using a deep neural network to extract features within the embedding and show how they improve the predictive performance of species distribution modelling. An important domain contribution of the DMSE model is the ability to discover and describe species interactions while simultaneously learning the shared habitat preferences among species. As an additional contribution, we provide a graphical embedding of hundreds of bird species in the Northeast US. Di Chen 0001, Yexiang Xue, Daniel Fink 0002, Shuo Chen 0008, Carla P. Gomes |
IJCAI | 1 |