paper-with-me

Papers

Unlocking Inverse Problems Using Deep Learning: Breaking Symmetries in Phase Retrieval

2020-10-23 · Kshitij Tayal, Chieh-Hsin Lai, Raunak Manekar, Zhong Zhuang, Vipin Kumar, Ju Sun

In many physical systems, inputs related by intrinsic system symmetries generate the same output. So when inverting such systems, an input is mapped to multiple symmetry-related outputs. This causes fundamental difficulty in tackling these inverse problems by the emerging end-to-end deep learning approach. Taking phase retrieval as an illustrative example, we show that careful symmetry breaking on the training data can help get rid of the difficulty and significantly improve learning performance on real data.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Retrieval

Similar Papers 제목 키워드 기반

What is Wrong with End-to-End Learning for Phase Retrieval?

2024-03-18 · Wenjie Zhang, Yuxiang Wan, Zhong Zhuang, Ju Sun

For nonlinear inverse problems that are prevalent in imaging science, symmetries in the forward model are common. When data-driven deep learning approaches are used to solve such problems, these intrinsic symmetries can …

Retrieval

Inverse Problems, Deep Learning, and Symmetry Breaking

2020-03-20 · Kshitij Tayal, Chieh-Hsin Lai, Vipin Kumar, Ju Sun

In many physical systems, inputs related by intrinsic system symmetries are mapped to the same output. When inverting such systems, i.e., solving the associated inverse problems, there is no unique solution. This causes …

Deep LearningRetrieval

Deep Learning Initialized Phase Retrieval

2020-10-23 · Raunak Manekar, Zhong Zhuang, Kshitij Tayal, Vipin Kumar 외

Phase retrieval (PR) consists of estimating 2D or 3D objects from their Fourier magnitudes and takes a central place in scientific imaging. At present, most iterative methods for PR work well only when the initialization…

Deep LearningRetrieval

Lifted Symmetry Detection and Breaking for MAP Inference

2015-12-01 · NeurIPS 2015 12 · Timothy Kopp, Parag Singla, Henry Kautz

Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that restrict the search space while preserving satisfiability. In this work, we extend symmetry b…

Relational ReasoningSymmetry Detection

Faster Symmetry Breaking Constraints for Abstract Structures

2025-11-14 · Özgür Akgün, Mun See Chang, Ian P. Gent, Christopher Jefferson arxiv

In constraint programming and related paradigms, a modeller specifies their problem in a modelling language for a solver to search and return its solution(s). Using high-level modelling languages such as Essence, a model…