Demo Data from EDBT 2026 / reviewers in the wild / expert
Alex Bo-Yuan Chen
dblp:401/6450 · also Alex B. Chen
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 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.
| Theoretical computer science
1 paper |
Algorithms and data structures · 67% Graph algorithms and graph theory · 33% | |
| Artificial intelligence
2 papers |
Video understanding and tracking · 60% Deep learning architectures and training · 40% | |
| Computer graphics and multimedia
1 paper |
Computational photography and imaging · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › neuroscience
neuroinformatics |
0.9 | 1 | 2025 | ZAPBench: A Benchmark for Whole-Brain Activity Prediction in Zebrafish · ICLR 2025 |
Machine learning › Deep learning architectures and training
convolutional neural network |
0.6 | 1 | 2022 | FourierNets enable the design of highly non-local optical encoders for computational imaging · NeurIPS 2022 |
Computational photography and imaging › computational optics
lensless imaging |
0.6 | 1 | 2022 | FourierNets enable the design of highly non-local optical encoders for computational imaging · NeurIPS 2022 |
Algorithms and data structures › sequence algorithms
dynamic time warping |
0.6 | 1 | 2022 | BILCO: An Efficient Algorithm for Joint Alignment of Time Series · NeurIPS 2022 |
Graph algorithms and graph theory › graph algorithms › network flow
maximum flow |
0.6 | 1 | 2022 | BILCO: An Efficient Algorithm for Joint Alignment of Time Series · NeurIPS 2022 |
Algorithms and data structures › sequence algorithms › string algorithms › sequence alignment
time series alignment |
0.6 | 1 | 2022 | BILCO: An Efficient Algorithm for Joint Alignment of Time Series · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
volumetric video modeling · 1.7time series forecasting · 1.7multi-GPU simulation · 1.1differentiable optical simulation · 1.1push-relabel · 0.6dynamic programming · 0.6bidirectional pushing · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ZAPBench: A Benchmark for Whole-Brain Activity Prediction in ZebrafishabstractData-driven benchmarks have led to significant progress in key scientific modeling domains including weather and structural biology. Here, we introduce the Zebrafish Activity Prediction Benchmark (ZAPBench) to measure progress on the problem of predicting cellular-resolution neural activity throughout an entire vertebrate brain. The benchmark is based on a novel dataset containing 4d light-sheet microscopy recordings of over 70,000 neurons in a larval zebrafish brain, along with motion stabilized and voxel-level cell segmentations of these data that facilitate development of a variety of forecasting methods. Initial results from a selection of time series and volumetric video modeling approaches achieve better performance than naive baseline methods, but also show room for further improvement. The specific brain used in the activity recording is also undergoing synaptic-level anatomical mapping, which will enable future integration of detailed structural information into forecasting methods. Jan-Matthis Lueckmann, Alexander Immer, Alex Bo-Yuan Chen, Peter H. Li, Mariela D. Petkova, Nirmala A. Iyer, Luuk Willem Hesselink, Aparna Dev, Gudrun Ihrke, Woohyun Park, Alyson Petruncio, Aubrey Weigel, Wyatt Korff, Florian Engert, Jeff Lichtman, Misha B. Ahrens, Michal Januszewski, Viren Jain |
ICLR | 3 |
| 2022 | FourierNets enable the design of highly non-local optical encoders for computational imagingabstractDifferentiable simulations of optical systems can be combined with deep learning-based reconstruction networks to enable high performance computational imaging via end-to-end (E2E) optimization of both the optical encoder and the deep decoder. This has enabled imaging applications such as 3D localization microscopy, depth estimation, and lensless photography via the optimization of local optical encoders. More challenging computational imaging applications, such as 3D snapshot microscopy which compresses 3D volumes into single 2D images, require a highly non-local optical encoder. We show that existing deep network decoders have a locality bias which prevents the optimization of such highly non-local optical encoders. We address this with a decoder based on a shallow neural network architecture using global kernel Fourier convolutional neural networks (FourierNets). We show that FourierNets surpass existing deep network based decoders at reconstructing photographs captured by the highly non-local DiffuserCam optical encoder. Further, we show that FourierNets enable E2E optimization of highly non-local optical encoders for 3D snapshot microscopy. By combining FourierNets with a large-scale multi-GPU differentiable optical simulation, we are able to optimize non-local optical encoders 170$\times$ to 7372$\times$ larger than prior state of the art, and demonstrate the potential for ROI-type specific optical encoding with a programmable microscope. Diptodip Deb, Zhenfei Jiao, Ruth R. Sims, Alex Bo-Yuan Chen, Michael Broxton, Misha B. Ahrens, Kaspar Podgorski, Srinivas C. Turaga |
NeurIPS | 4 |
| 2022 | BILCO: An Efficient Algorithm for Joint Alignment of Time SeriesabstractMultiple time series data occur in many real applications and the alignment among them is usually a fundamental step of data analysis. Frequently, these multiple time series are inter-dependent, which provides extra information for the alignment task and this information cannot be well utilized in the conventional pairwise alignment methods. Recently, the joint alignment was modeled as a max-flow problem, in which both the profile similarity between the aligned time series and the distance between adjacent warping functions are jointly optimized. However, despite the new model having elegant mathematical formulation and superior alignment accuracy, the long computation time and large memory usage, due to the use of the existing general-purpose max-flow algorithms, limit significantly its well-deserved wide use. In this report, we present BIdirectional pushing with Linear Component Operations (BILCO), a novel algorithm that solves the joint alignment max-flow problems efficiently and exactly. We develop the strategy of linear component operations that integrates dynamic programming technique and the push-relabel approach. This strategy is motivated by the fact that the joint alignment max-flow problem is a generalization of dynamic time warping (DTW) and numerous individual DTW problems are embedded. Further, a bidirectional-pushing strategy is proposed to introduce prior knowledge and reduce unnecessary computation, by leveraging another fact that good initialization can be easily computed for the joint alignment max-flow problem. We demonstrate the efficiency of BILCO using both synthetic and real experiments. Tested on thousands of datasets under various simulated scenarios and in three distinct application categories, BILCO consistently achieves at least 10 and averagely 20-folds increase in speed, and uses at most 1/8 and averagely 1/10 memory compared with the best existing max-flow method. Our source code can be found at https://github.com/yu-lab-vt/BILCO. Xuelong Mi, Mengfan Wang, Alex Bo-Yuan Chen, Jing-Xuan Lim, Misha B. Ahrens, Guoqiang Yu |
NeurIPS | 3 |