1 code implementation • 27 Feb 2024 • Hongyu Shen, Yici Yan, Zhizhen Zhao
In DeepDRK, we introduce a novel formulation of the knockoff model as a learning problem under multi-source adversarial attacks.
1 code implementation • 18 Jun 2023 • Lingda Wang, Savana Ammons, Vera Mikyoung Hur, Ryan L. Sriver, Zhizhen Zhao
Predicting sea surface temperature (SST) within the El Ni\~no-Southern Oscillation (ENSO) region has been extensively studied due to its significant influence on global temperature and precipitation patterns.
no code implementations • 9 Dec 2022 • Javier Duarte, Haoyang Li, Avik Roy, Ruike Zhu, E. A. Huerta, Daniel Diaz, Philip Harris, Raghav Kansal, Daniel S. Katz, Ishaan H. Kavoori, Volodymyr V. Kindratenko, Farouk Mokhtar, Mark S. Neubauer, Sang Eon Park, Melissa Quinnan, Roger Rusack, Zhizhen Zhao
The findable, accessible, interoperable, and reusable (FAIR) data principles provide a framework for examining, evaluating, and improving how data is shared to facilitate scientific discovery.
no code implementations • 30 Sep 2022 • E. A. Huerta, Ben Blaiszik, L. Catherine Brinson, Kristofer E. Bouchard, Daniel Diaz, Caterina Doglioni, Javier M. Duarte, Murali Emani, Ian Foster, Geoffrey Fox, Philip Harris, Lukas Heinrich, Shantenu Jha, Daniel S. Katz, Volodymyr Kindratenko, Christine R. Kirkpatrick, Kati Lassila-Perini, Ravi K. Madduri, Mark S. Neubauer, Fotis E. Psomopoulos, Avik Roy, Oliver Rübel, Zhizhen Zhao, Ruike Zhu
A foundational set of findable, accessible, interoperable, and reusable (FAIR) principles were proposed in 2016 as prerequisites for proper data management and stewardship, with the goal of enabling the reusability of scholarly data.
no code implementations • 28 Jul 2022 • Xiaoming Zhao, Zhizhen Zhao, Alexander G. Schwing
While recovery of geometry from image and video data has received a lot of attention in computer vision, methods to capture the texture for a given geometry are less mature.
1 code implementation • 6 Jul 2022 • Shuai Huang, Mona Zehni, Ivan Dokmanić, Zhizhen Zhao
Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D projections at unknown, random orientations.
1 code implementation • 16 Jun 2022 • Lingda Wang, Zhizhen Zhao
This problem, with a variety of real-world applications, aims to recover the cluster structure and associated phase angles simultaneously.
1 code implementation • 25 Dec 2021 • Yifeng Fan, Yuehaw Khoo, Zhizhen Zhao
Community detection and orthogonal group synchronization are both fundamental problems with a variety of important applications in science and engineering.
no code implementations • 23 Aug 2021 • Mona Zehni, Zhizhen Zhao
The goal of 2D tomographic reconstruction is to recover an image given its projections from various views.
no code implementations • 4 Aug 2021 • Jiangran Wang, Zhuo Chen, Di Luo, Zhizhen Zhao, Vera Mikyoung Hur, Bryan K. Clark
We develop a spacetime neural network method with second order optimization for solving quantum dynamics from the high dimensional Schr\"{o}dinger equation.
no code implementations • 4 Aug 2021 • Yifan Chen, E. A. Huerta, Javier Duarte, Philip Harris, Daniel S. Katz, Mark S. Neubauer, Daniel Diaz, Farouk Mokhtar, Raghav Kansal, Sang Eon Park, Volodymyr V. Kindratenko, Zhizhen Zhao, Roger Rusack
To enable the reusability of massive scientific datasets by humans and machines, researchers aim to adhere to the principles of findability, accessibility, interoperability, and reusability (FAIR) for data and artificial intelligence (AI) models.
no code implementations • 13 May 2021 • E. A. Huerta, Zhizhen Zhao
In tandem with the advent of large-scale scientific facilities, the last decade has experienced an unprecedented transformation in computing and signal processing algorithms.
no code implementations • 13 May 2021 • Safa Messaoud, Ismini Lourentzou, Assma Boughoula, Mona Zehni, Zhizhen Zhao, ChengXiang Zhai, Alexander G. Schwing
The recent growth of web video sharing platforms has increased the demand for systems that can efficiently browse, retrieve and summarize video content.
1 code implementation • 13 May 2021 • Yifeng Fan, Yuehaw Khoo, Zhizhen Zhao
In the presence of heterogeneous data, where randomly rotated objects fall into multiple underlying categories, it is challenging to simultaneously classify them into clusters and synchronize them based on pairwise relations.
no code implementations • 19 Feb 2021 • Parisa Karimi, Mark Butala, Zhizhen Zhao, Farzad Kamalabadi
The evolution of images with physics-based dynamics is often spatially localized and nonlinear.
1 code implementation • 18 Feb 2021 • Mona Zehni, Zhizhen Zhao
We formulate MSR as a distribution matching problem where the goal is to recover the signal and the probability distribution of the segments such that the distribution of the generated measurements following a known forward model is close to the real observations.
1 code implementation • 9 Feb 2021 • Mona Zehni, Zhizhen Zhao
To accommodate this, we use Gumbel-softmax approximation of samples from categorical distribution to approximate the generator's loss as a function of the unknown image and the projection distribution.
no code implementations • 18 Jan 2021 • Di Luo, Zhuo Chen, Kaiwen Hu, Zhizhen Zhao, Vera Mikyoung Hur, Bryan K. Clark
Symmetries such as gauge invariance and anyonic symmetry play a crucial role in quantum many-body physics.
no code implementations • 10 Dec 2020 • Lingda Wang, Bingcong Li, Huozhi Zhou, Georgios B. Giannakis, Lav R. Varshney, Zhizhen Zhao
The second algorithm, \texttt{EXP3-LGC-IX}, is developed for a special class of problems, for which the regret is reduced to $\mathcal{O}(\sqrt{\alpha(G)dT\log{K}\log(KT)})$ for both directed as well as undirected feedback graphs.
no code implementations • 9 Dec 2020 • Bingcong Li, Lingda Wang, Georgios B. Giannakis, Zhizhen Zhao
Relying on no problem dependent parameters in the step sizes, the convergence rate of ExtraFW for general convex problems is shown to be ${\cal O}(\frac{1}{k})$, which is optimal in the sense of matching the lower bound on the number of solved FW subproblems.
no code implementations • 8 Dec 2020 • Parisa Karimi, Mark Butala, Zhizhen Zhao, Farzad Kamalabadi
The computation required for a switching Kalman Filter (SKF) increases exponentially with the number of system operation modes.
no code implementations • 8 Dec 2020 • Parisa Karimi, Zhizhen Zhao, Mark Butala, Farzad Kamalabadi
One can use these derivations to quantify the average performance of filters beforehand and decide which filter to run in operation to have the best performance in terms of estimation error and computation complexity.
1 code implementation • arXiv 2019 • Arjun Gupta, E. A. Huerta, Zhizhen Zhao, Issam Moussa
Myocardial infarction is the leading cause of death worldwide.
no code implementations • 26 Nov 2019 • E. A. Huerta, Gabrielle Allen, Igor Andreoni, Javier M. Antelis, Etienne Bachelet, Bruce Berriman, Federica Bianco, Rahul Biswas, Matias Carrasco, Kyle Chard, Minsik Cho, Philip S. Cowperthwaite, Zachariah B. Etienne, Maya Fishbach, Francisco Förster, Daniel George, Tom Gibbs, Matthew Graham, William Gropp, Robert Gruendl, Anushri Gupta, Roland Haas, Sarah Habib, Elise Jennings, Margaret W. G. Johnson, Erik Katsavounidis, Daniel S. Katz, Asad Khan, Volodymyr Kindratenko, William T. C. Kramer, Xin Liu, Ashish Mahabal, Zsuzsa Marka, Kenton McHenry, Jonah Miller, Claudia Moreno, Mark Neubauer, Steve Oberlin, Alexander R. Olivas, Donald Petravick, Adam Rebei, Shawn Rosofsky, Milton Ruiz, Aaron Saxton, Bernard F. Schutz, Alex Schwing, Ed Seidel, Stuart L. Shapiro, Hongyu Shen, Yue Shen, Leo Singer, Brigitta M. Sipőcz, Lunan Sun, John Towns, Antonios Tsokaros, Wei Wei, Jack Wells, Timothy J. Williams, JinJun Xiong, Zhizhen Zhao
Multi-messenger astrophysics is a fast-growing, interdisciplinary field that combines data, which vary in volume and speed of data processing, from many different instruments that probe the Universe using different cosmic messengers: electromagnetic waves, cosmic rays, gravitational waves and neutrinos.
no code implementations • 12 Sep 2019 • Lingda Wang, Huozhi Zhou, Bingcong Li, Lav R. Varshney, Zhizhen Zhao
Cascading bandit (CB) is a popular model for web search and online advertising, where an agent aims to learn the $K$ most attractive items out of a ground set of size $L$ during the interaction with a user.
1 code implementation • 6 Jun 2019 • Yifeng Fan, Tingran Gao, Zhizhen Zhao
We introduce a novel co-learning paradigm for manifolds naturally equipped with a group action, motivated by recent developments on learning a manifold from attached fibre bundle structures.
no code implementations • 6 Jun 2019 • Yifeng Fan, Zhizhen Zhao
We introduce multi-frequency vector diffusion maps (MFVDM), a new framework for organizing and analyzing high dimensional datasets.
no code implementations • 31 May 2019 • Yifeng Fan, Tingran Gao, Zhizhen Zhao
We develop in this paper a novel intrinsic classification algorithm -- multi-frequency class averaging (MFCA) -- for classifying noisy projection images obtained from three-dimensional cryo-electron microscopy (cryo-EM) by the similarity among their viewing directions.
no code implementations • 16 Apr 2019 • Yifeng Fan, Zhizhen Zhao
Cryo-electron microscopy (EM) single particle reconstruction is an entirely general technique for 3D structure determination of macromolecular complexes.
no code implementations • CVPR 2019 • Ishan Deshpande, Yuan-Ting Hu, Ruoyu Sun, Ayis Pyrros, Nasir Siddiqui, Sanmi Koyejo, Zhizhen Zhao, David Forsyth, Alexander Schwing
Generative adversarial nets (GANs) and variational auto-encoders have significantly improved our distribution modeling capabilities, showing promise for dataset augmentation, image-to-image translation and feature learning.
no code implementations • 6 Mar 2019 • Hongyu Shen, Daniel George, E. A. Huerta, Zhizhen Zhao
Denoising of time domain data is a crucial task for many applications such as communication, translation, virtual assistants etc.
no code implementations • 5 Mar 2019 • Hongyu Shen, E. A. Huerta, Eamonn O'Shea, Prayush Kumar, Zhizhen Zhao
Upon confirming that our models produce statistically consistent results, we used them to estimate the astrophysical parameters $(m_1, m_2, a_f, \omega_R, \omega_I)$ of five binary black holes: $\texttt{GW150914}, \texttt{GW170104}, \texttt{GW170814}, \texttt{GW190521}$ and $\texttt{GW190630}$.
no code implementations • 1 Feb 2019 • Gabrielle Allen, Igor Andreoni, Etienne Bachelet, G. Bruce Berriman, Federica B. Bianco, Rahul Biswas, Matias Carrasco Kind, Kyle Chard, Minsik Cho, Philip S. Cowperthwaite, Zachariah B. Etienne, Daniel George, Tom Gibbs, Matthew Graham, William Gropp, Anushri Gupta, Roland Haas, E. A. Huerta, Elise Jennings, Daniel S. Katz, Asad Khan, Volodymyr Kindratenko, William T. C. Kramer, Xin Liu, Ashish Mahabal, Kenton McHenry, J. M. Miller, M. S. Neubauer, Steve Oberlin, Alexander R. Olivas Jr, Shawn Rosofsky, Milton Ruiz, Aaron Saxton, Bernard Schutz, Alex Schwing, Ed Seidel, Stuart L. Shapiro, Hongyu Shen, Yue Shen, Brigitta M. Sipőcz, Lunan Sun, John Towns, Antonios Tsokaros, Wei Wei, Jack Wells, Timothy J. Williams, JinJun Xiong, Zhizhen Zhao
We discuss key aspects to realize this endeavor, namely (i) the design and exploitation of scalable and computationally efficient AI algorithms for Multi-Messenger Astrophysics; (ii) cyberinfrastructure requirements to numerically simulate astrophysical sources, and to process and interpret Multi-Messenger Astrophysics data; (iii) management of gravitational wave detections and triggers to enable electromagnetic and astro-particle follow-ups; (iv) a vision to harness future developments of machine and deep learning and cyberinfrastructure resources to cope with the scale of discovery in the Big Data Era; (v) and the need to build a community that brings domain experts together with data scientists on equal footing to maximize and accelerate discovery in the nascent field of Multi-Messenger Astrophysics.
1 code implementation • ICLR 2019 • Renjie Liao, Zhizhen Zhao, Raquel Urtasun, Richard S. Zemel
We propose the Lanczos network (LanczosNet), which uses the Lanczos algorithm to construct low rank approximations of the graph Laplacian for graph convolution.
1 code implementation • 20 Dec 2018 • Zhizhen Zhao, Lydia T. Liu, Amit Singer
The second is steerable PCA, a fast and accurate procedure for including all planar rotations for PCA.
1 code implementation • 25 Nov 2018 • Mona Zehni, Shuai Huang, Ivan Dokmanić, Zhizhen Zhao
For a point source model, we show that these features reveal geometric information about the model such as the radial and pairwise distances.
1 code implementation • 7 May 2018 • E. A. Huerta, Daniel George, Zhizhen Zhao, Gabrielle Allen
We discuss the development of novel deep learning algorithms to enable real-time regression analysis for time series data.
1 code implementation • 25 Feb 2018 • Mona Zehni, Minh N. Do, Zhizhen Zhao
Instead of trying to locate the segment within the sequence through pair-wise matching, we propose a new approach that uses shift-invariant features to estimate both the underlying signal and the distribution of the positions of the segments.
Signal Processing
no code implementations • 27 Nov 2017 • Hongyu Shen, Daniel George, E. A. Huerta, Zhizhen Zhao
Gravitational wave signals are often extremely weak and the data from the detectors, such as LIGO, is contaminated with non-Gaussian and non-stationary noise, often containing transient disturbances which can obscure real signals.
no code implementations • 10 Nov 2016 • Tejal Bhamre, Zhizhen Zhao, Amit Singer
Single particle reconstruction (SPR) from cryo-electron microscopy (EM) is a technique in which the 3D structure of a molecule needs to be determined from its contrast transfer function (CTF) affected, noisy 2D projection images taken at unknown viewing directions.
no code implementations • 2 Dec 2014 • Zhizhen Zhao, Yoel Shkolnisky, Amit Singer
Cryo-electron microscopy nowadays often requires the analysis of hundreds of thousands of 2D images as large as a few hundred pixels in each direction.
no code implementations • 29 Sep 2013 • Zhizhen Zhao, Amit Singer
Our pipeline for viewing angle classification and alignment is experimentally shown to be faster and more accurate than reference-free alignment with rotationally invariant K-means clustering, MSA/MRA 2D classification, and their modern approximations.