English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we study the minimax rates and provide an implementable convex algorithm for Poisson inverse problems under weak sparsity and physical constraints. In particular, we assume the model yi ~ Poisson(TaiT f*) for 1 &#x2264; i &#x2264; n, where T &#x2208; &#x211D;+ is the intensity, and we impose weak sparsity on f* &#x2208; &#x211D;p by assuming f* lies in an &#x2113;q-ball when rotated according to an orthonormal basis D &#x2208; &#x211D;p&#x00D7;p. In addition, since we are modeling real-physical systems, we also impose positivity and flux-preserving constraints on the matrix A = [a1, a2, ... , an]T and the function f*. We prove minimax lower bounds for this model, which scale as Rq(log p/T)1-(q/2) where it is noticeable that the rate depends on the intensity T and not the sample size n. We also show that an &#x2113;1-based regularized least-squares estimator achieves this minimax lower bound, provided a suitable restricted eigenvalue condition is satisfied. Finally, we prove that provided n &#x2265; K&#x0303; log p where K&#x0303; = &#x0398;(Rq(log p/T)-(q/2)) represents an approximate sparsity level, and our restricted eigenvalue condition and physical constraints are satisfied for random bounded ensembles. We also provide numerical experiments that validate our mean-squared error bounds. Our results address a number of open issues from prior work on Poisson inverse problems that focuses on strictly sparse models and does not provide guarantees for convex implementable algorithms.

ieee transactions on information theory

Minimax Optimal Convex Methods for Poisson Inverse Problems Under <inline-formula> <tex-math notation="LaTeX">$\ell_{q}$ </tex-math></inline-formula>-Ball Sparsity

Minimax Optimal Convex Methods for Poisson Inverse Problems Under $\ell_{q}$ -Ball Sparsity