English
Related papers

Related papers: Second-Order Converses via Reverse Hypercontractiv…

200 papers

Second-order optimization methods, such as cubic regularized Newton methods, are known for their rapid convergence rates; nevertheless, they become impractical in high-dimensional problems due to their substantial memory requirements and…

Optimization and Control · Mathematics 2024-01-09 Ruichen Jiang , Parameswaran Raman , Shoham Sabach , Aryan Mokhtari , Mingyi Hong , Volkan Cevher

This article studies the finite time blow-up of weak solutions to a structural acoustics model consisting of a semilinear wave equation defined on a bounded domain $\Omega\subset\mathbb{R}^3$ which is strongly coupled with a Berger plate…

Analysis of PDEs · Mathematics 2023-01-03 Baowei Feng , Yanqiu Guo , Mohammad A. Rammaha

We unify the variational hypocoercivity framework established by D. Albritton, S. Armstrong, J.-C. Mourrat, and M. Novack, with the notion of second-order lifts of reversible diffusion processes, recently introduced by A. Eberle and F.…

Probability · Mathematics 2025-02-07 Giovanni Brigati , Francis Lörler , Lihan Wang

In this paper analytic contractions have been established in the $R\to\infty$ contraction limit for exactly solvable basis functions of the Helmholtz equation on the two-dimensional two-sheeted hyperboloid. As a consequence we present some…

Mathematical Physics · Physics 2012-12-27 Ernie Kalnins , George S. Pogosyan , Alexander Yakhno

In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form $$ \kappa({\mathcal U}) \le…

Classical Analysis and ODEs · Mathematics 2019-03-12 Raf Cluckers , Omer Friedland , Yosef Yomdin

We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with…

Information Theory · Computer Science 2014-12-30 Shun Watanabe , Shigeaki Kuzuoka , Vincent Y. F. Tan

The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for…

Quantum Physics · Physics 2015-02-10 Manish K. Gupta , Mark M. Wilde

We prove sharp blow up rates of solutions of higher order conformally invariant equations in a bounded domain with an isolated singularity, and show the asymptotic radial symmetry of the solutions near the singularity. This is an extension…

Analysis of PDEs · Mathematics 2019-01-15 Tianling Jin , Jingang Xiong

We build blowing-up solutions for a supercritical perturbation of the Yamabe problem on manifolds with boundary, provided the dimension of the manifold is n>6 and the trace-free part of the second fundamental form is non-zero everywhere on…

Differential Geometry · Mathematics 2020-09-21 Marco G. Ghimenti , Anna Maria Micheletti

In Part I of this series, the limits on the sustained performance of large reversible computers were investigated and found to scale as $\sqrt{AV}$ where $A$ is the convex bounding surface area of the system and $V$ its internal volume,…

Statistical Mechanics · Physics 2021-12-02 Hannah Earley

We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new…

Information Theory · Computer Science 2009-10-06 Himanshu Tyagi , Prakash Narayan

We show the relationship between the strongly non-linear limit (also termed the dispersionless or the Whitham limit) of the macroscopic fluctuation theory of certain statistical models and the inverse scattering method. We show that in the…

Statistical Mechanics · Physics 2023-08-08 Eldad Bettelheim

In this paper we use the blow-up surgery introduced in [G] to produce new higher dimensional partially hyperbolic flows. The main contribution of the paper is the slow-down construction which accompanies the blow-up construction. This new…

Dynamical Systems · Mathematics 2020-01-01 Andrey Gogolev , Federico Rodriguez Hertz

We consider the $k$-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the…

Information Theory · Computer Science 2019-05-22 Lin Zhou , Alfred Hero

We treat a random number generation from an i.i.d. probability distribution of $P$ to that of $Q$. When $Q$ or $P$ is a uniform distribution, the problems have been well-known as the uniform random number generation and the resolvability…

Information Theory · Computer Science 2013-03-05 Wataru Kumagai , Masahito Hayashi

This paper studies the second-order achievabilities of indirect quadratic lossy source coding for a specific class of source models, where the term "quadratic" denotes that the reconstruction fidelity of the hidden source is quantified by a…

Information Theory · Computer Science 2024-10-15 Huiyuan Yang , Xiaojun Yuan

We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols. Our proofs use the notion of information cost of a protocol, as defined by Chakrabarti, Shi, Wirth and Yao and…

Computational Complexity · Computer Science 2007-05-23 Rahul Jain , Jaikumar Radhakrishnan , Pranab Sen

We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $\epsilon > 0$ and privacy parameter $\delta > 0$ satisfy the…

Quantum Physics · Physics 2025-07-22 Zahra Baghali Khanian , Christoph Hirche

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

Logic in Computer Science · Computer Science 2023-02-15 Nicolai Kraus , Jakob von Raumer

Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by…

Quantum Physics · Physics 2018-04-17 Dawei Ding , Mark M. Wilde