4 citations · 11 across the 26 of their papers we have counts for
8 papers · 1 filter
Backward-Consistent Diffusion Sampling for Sparsely Observed PDE Inverse Problems
Yida Pan, Muhammad H. Ashiq, Chanyong Jung +4
Recovering Partial Differential Equation (PDE) coefficient fields from extremely sparse observations is a severely ill-posed inverse problem for which generative machine learning m…
Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut
Jingjuan Huang, Alvaro Velasquez, Cheng-Han Huang +3
Multi-objective combinatorial optimization arises in a wide range of problems and applications, including the canonical multi-objective MaxCut problem. Differentiable single-instan…
Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs
Cheng-Han Huang, Yongliang Sun, Chaoyan Huang +2
Many combinatorial optimization problems admit quadratic unconstrained binary formulations (QUBO) which can often be relaxed to the box and optimized using scalable gradi…
ForcingDAS: Unified and Robust Data Assimilation via Diffusion Forcing
Yixuan Jia, Siyi Chen, Yida Pan +9
Data assimilation (DA) estimates the state of an evolving dynamical system from noisy, partial observations, and is widely used in scientific simulation as well as weather and clim…
A Principled Self-Referenced Early Stopping Approach for Deep Image Prior
Chaoyan Huang, Cheng-Han Huang, Ismail R. Alkhouri +1
Recently, Deep Image Prior (DIP) has demonstrated strong capabilities for solving inverse imaging problems (IIPs) by optimizing a randomly initialized convolutional neural network…
Dynamic MRI Reconstruction Via Dual Deep Priors and Low-Rank Plus Sparse Modeling
Yongliang Sun, Siddhant Gautam, Chaoyan Huang +3
Dynamic MRI reconstruction from undersampled measurements is a challenging inverse problem that requires preserving both spatial reconstruction quality and temporal consistency acr…
Differentiable Repairability & Mutations for Scalable Combinatorial Optimization
Yongliang Sun, Ismail Alkhouri, Cheng-Han Huang +3
Combinatorial optimization problems such as Maximum Independent Set (MIS) and Maximum Cut (MaxCut) arise across a wide range of applications, yet solving large-scale instances rema…
GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
Curie Kim, Carsten Portner, Mingju Liu +6
Boolean satisfiability (SAT) problem, the first problem proven to be NP-complete, has become a fundamental challenge in computational complexity, with widespread applications in op…