1,176 research outputs found

    About Adaptive Coding on Countable Alphabets: Max-Stable Envelope Classes

    Full text link
    In this paper, we study the problem of lossless universal source coding for stationary memoryless sources on countably infinite alphabets. This task is generally not achievable without restricting the class of sources over which universality is desired. Building on our prior work, we propose natural families of sources characterized by a common dominating envelope. We particularly emphasize the notion of adaptivity, which is the ability to perform as well as an oracle knowing the envelope, without actually knowing it. This is closely related to the notion of hierarchical universal source coding, but with the important difference that families of envelope classes are not discretely indexed and not necessarily nested. Our contribution is to extend the classes of envelopes over which adaptive universal source coding is possible, namely by including max-stable (heavy-tailed) envelopes which are excellent models in many applications, such as natural language modeling. We derive a minimax lower bound on the redundancy of any code on such envelope classes, including an oracle that knows the envelope. We then propose a constructive code that does not use knowledge of the envelope. The code is computationally efficient and is structured to use an {E}xpanding {T}hreshold for {A}uto-{C}ensoring, and we therefore dub it the \textsc{ETAC}-code. We prove that the \textsc{ETAC}-code achieves the lower bound on the minimax redundancy within a factor logarithmic in the sequence length, and can be therefore qualified as a near-adaptive code over families of heavy-tailed envelopes. For finite and light-tailed envelopes the penalty is even less, and the same code follows closely previous results that explicitly made the light-tailed assumption. Our technical results are founded on methods from regular variation theory and concentration of measure

    Asymptotic Hyperfunctions, Tempered Hyperfunctions, and Asymptotic Expansions

    Get PDF
    We introduce new subclasses of Fourier hyperfunctions of mixed type, satisfying polynomial growth conditions at infinity, and develop their sheaf and duality theory. We use Fourier transformation and duality to examine relations of these 'asymptotic' and 'tempered' hyperfunctions to known classes of test functions and distributions, especially the Gelfand-Shilov-Spaces. Further it is shown that the asymptotic hyperfunctions, which decay faster than any negative power, are precisely the class that allow asymptotic expansions at infinity. These asymptotic expansions are carried over to the higher-dimensional case by applying the Radon transformation for hyperfunctions.Comment: 31 pages, 1 figure, typos corrected, references adde

    Computing the Similarity Between Moving Curves

    Get PDF
    In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or retreating glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time. We therefore focus on similarity measures for surfaces, specifically the Fr\'echet distance between surfaces. While the Fr\'echet distance between surfaces is not even known to be computable, we show for variants arising in the context of moving curves that they are polynomial-time solvable or NP-complete depending on the restrictions imposed on how the moving curves are matched. We achieve the polynomial-time solutions by a novel approach for computing a surface in the so-called free-space diagram based on max-flow min-cut duality

    Archimedean theory and ϵ\epsilon-factors for the Asai Rankin-Selberg integrals

    Full text link
    In this paper, we partially complete the local Rankin-Selberg theory of Asai LL-functions and ϵ\epsilon-factors as introduced by Flicker and Kable. In particular, we establish the relevant local functional equation at Archimedean places and prove the equality between Rankin-Selberg's and Langlands-Shahidi's ϵ\epsilon-factors at every place. Our proofs work uniformly for any characteristic zero local field and use as only input the global functional equation and a globalization result for a dense subset of tempered representations that we infer from work of Finis-Lapid-M\"uller. These results are used in another paper by the author to establish an explicit Plancherel decomposition for GLn(F)\GLn(E)\mathrm{GL}_n(F)\backslash \mathrm{GL}_n(E), E/FE/F a quadratic extension of local fields, with applications to the Ichino-Ikeda and formal degree conjecture for unitary groups
    corecore