English
Related papers

Related papers: Pushdown and Lempel-Ziv Depth

200 papers

The first aims of this work are to endorse the advent of finitely additive set functions as equilibrium states and the possibility to replace the metric entropy by an upper semi-continuous map associated to a general variational principle.…

Dynamical Systems · Mathematics 2022-04-07 Andrzej Bis , Maria Carvalho , Miguel Mendes , Paulo Varandas

During a spontaneous change, a macroscopic physical system will evolve towards a macro-state with more realizations. This observation is at the basis of the Statistical Mechanical version of the Second Law of Thermodynamics, and it provides…

Statistical Mechanics · Physics 2020-04-22 Mengjie Zu , Arunkumar Bupathy , Daan Frenkel , Srikanth Sastry

Recent developments in theoretical linguistics have lead to a widespread acceptance of constraint-based analyses of prosodic morphology phenomena such as truncation, infixation, floating morphemes and reduplication. Of these, reduplication…

Computation and Language · Computer Science 2007-05-23 Markus Walther

Typically, physical and conceptual rainfall-runoff models are developed independently and are based on different, though not entirely incompatible, governing principles. In this work, we perform a systematic asymptotic analysis of a typical…

Fluid Dynamics · Physics 2023-12-05 Piotr Morawiecki , Philippe H. Trinh

The conventional definition of a depth function is vector-based. In this paper, a novel projection depth (PD) technique directly based on tensors, such as matrices, is instead proposed. Tensor projection depth (TPD) is still an ideal depth…

Statistics Theory · Mathematics 2012-01-06 Yonggang Hu , Yong Wang , Yi Wu

Neural networks and other machine learning models compute continuous representations, while humans communicate with discrete symbols. Reconciling these two forms of communication is desirable to generate human-readable interpretations or to…

Machine Learning · Computer Science 2021-04-05 André F. T. Martins

Machine Learning models should ideally be compact and robust. Compactness provides efficiency and comprehensibility whereas robustness provides resilience. Both topics have been studied in recent years but in isolation. Here we present a…

Machine Learning · Computer Science 2021-03-16 Omri Armstrong , Ran Gilad-Bachrach

When a droplet is generated, the ligament connecting the drop to the nozzle thins down and eventually pinches off. Adding solid particles to the liquid phase leads to a more complex dynamic, notably by increasing the shear viscosity.…

Soft Condensed Matter · Physics 2021-05-24 Virgile Thiévenaz , Sreeram Rajesh , Alban Sauret

The aim of this paper is to introduce new statistical criterions for estimation, suitable for inference in models with common continuous support. This proposal is in the direct line of a renewed interest for divergence based inference tools…

Statistics Theory · Mathematics 2015-03-19 Michel Broniatowski , Aida Toma , Igor Vajda

A guessing wiretapper's performance on a Shannon cipher system is analyzed for a source with memory. Close relationships between guessing functions and length functions are first established. Subsequently, asymptotically optimal encryption…

Information Theory · Computer Science 2016-11-17 Rajesh Sundaresan

Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such clear measure exists for the compressibility of repetitive sequences. Since statistical entropy does not capture repetitiveness, ad-hoc measures…

Data Structures and Algorithms · Computer Science 2021-01-18 Tomasz Kociumaka , Gonzalo Navarro , Nicola Prezza

The success of deep neural networks in many real-world applications is leading to new challenges in building more efficient architectures. One effective way of making networks more efficient is neural network compression. We provide an…

Machine Learning · Computer Science 2019-12-23 Andrey Kuzmin , Markus Nagel , Saurabh Pitre , Sandeep Pendyam , Tijmen Blankevoort , Max Welling

Behavioural distances provide a robust alternative to notions of equivalence such as bisimilarity in the context of probabilistic transition systems. They can be defined as least fixed points, whose universal property allows us to exhibit…

Logic in Computer Science · Computer Science 2025-10-14 Ruben Turkenburg , Harsh Beohar , Franck van Breugel , Clemens Kupke , Jurriaan Rot

Solving partially observable Markov decision processes (POMDPs) requires computing policies under imperfect state information. Despite recent advances, the scalability of existing POMDP solvers remains limited. Moreover, many settings…

Artificial Intelligence · Computer Science 2026-04-02 David Hudák , Maris F. L. Galesloot , Martin Tappler , Martin Kurečka , Nils Jansen , Milan Češka

Data compression continues to evolve, with traditional information theory methods being widely used for compressing text, images, and videos. Recently, there has been growing interest in leveraging Generative AI for predictive compression…

Information Theory · Computer Science 2024-09-24 Swathi Shree Narashiman , Nitin Chandrachoodan

This paper presents new methods for set-valued state estimation and active fault diagnosis of linear descriptor systems. The algorithms are based on constrained zonotopes, a generalization of zonotopes capable of describing strongly…

Systems and Control · Electrical Eng. & Systems 2023-04-11 Brenner S. Rego , Davide M. Raimondo , Guilherme V. Raffo

In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection push the boundaries of what we can learn about programs statically. This work illuminates and poses solutions to theoretical and practical…

Programming Languages · Computer Science 2014-06-20 J. Ian Johnson , Ilya Sergey , Christopher Earl , Matthew Might , David Van Horn

In this paper we study the notion of estimation entropy recently established by Liberzon and Mitra. This quantity measures the smallest rate of information about the state of a dynamical system above which an exponential state estimation…

Dynamical Systems · Mathematics 2017-05-08 Christoph Kawan

We introduce a new approach to LZ77 factorization that uses O(n/d) words of working space and O(dn) time for any d >= 1 (for polylogarithmic alphabet sizes). We also describe carefully engineered implementations of alternative approaches to…

Data Structures and Algorithms · Computer Science 2020-12-11 Juha Kärkkäinen , Dominik Kempa , Simon J. Puglisi

We propose algorithms computing the semi-greedy Lempel-Ziv 78 (LZ78), the Lempel-Ziv Double (LZD), and the Lempel-Ziv-Miller-Wegman (LZMW) factorizations in linear time for integer alphabets. For LZD and LZMW, we additionally propose data…

Data Structures and Algorithms · Computer Science 2024-09-24 Dominik Köppl