Proves uniqueness of measure of maximal entropy for geodesic flows on surfaces.
problem Proving uniqueness of measure of maximal entropy for geodesic flows on surfaces.
method Analyzes geodesic flows on closed orientable C^∞ surfaces, proving uniqueness of measure of maximal entropy and at most one SRB measure.
result Proves uniqueness of measure of maximal entropy for geodesic flows on surfaces, covering previous results and new examples.
Maximal representations show strong entropy rigidity.
problem Entropy rigidity for maximal representations.
method Measurable hypertransversality, Gromov product, Bowen-Margulis-Sullivan measure.
result Strong entropy rigidity proved for maximal representations.
New measure of maximal entropy found for a class of geometrically finite groups.
problem Finding a measure of maximal entropy for relatively Anosov groups.
method Constructing reparameterizations and using exponential expansion along unstable foliations.
result The Bowen-Margulis-Sullivan measure is finite and unique for relatively Anosov groups.
Study geodesic flows on hyperbolic manifolds without conjugate points, proving unique measure of maximal entropy.
problem Proving uniqueness of measure of maximal entropy for geodesic flows on specific manifolds.
method Analyzing geodesic flows on closed Riemannian manifolds without conjugate points, using properties of Gromov hyperbolic and residually finite groups.
result Proves geodesic flow has a unique measure of maximal entropy under appropriate assumptions.
The paper proves a quantitative rigidity result for spaces with specific curvature bounds.
problem Understanding the rigidity of spaces with almost maximal volume entropy.
method Analyzing Riemannian manifolds and RCD-spaces with specific curvature conditions. result Spaces with almost maximal volume entropy are closely related to hyperbolic space forms.
Geodesic flows on compact manifolds without conjugate points are shown to have a unique measure of maximal entropy.
problem Analyzing geodesic flows on compact manifolds without conjugate points and with visibility universal covering.
method Using topological mixing, local product structure, and properties of geodesic flows, the authors prove the existence of an expansive factor and uniqueness of measure of maximal entropy.
result The geodesic flow on compact manifolds without conjugate points has a unique measure of maximal entropy.
The study proves the uniqueness of entropy-maximizing measures for geodesic flows on specific manifolds.
problem Uniqueness of entropy-maximizing measures for geodesic flows on rank 1 manifolds.
method Symbolic dynamics applied to countable topological Markov flows.
result Proof of the uniqueness of the measure of maximal entropy.
We prove that for closed surfaces M with Riemannian metrics without conjugate points and genus ≥2 the geodesic flow on the unit tangent bundle T1M has a unique measure of maximal entropy. Furthermore, this measure is fully supported on T1M and the flow is mixing with respect to this measure. We formulate …
Unique entropy measure found for convex projective manifolds.
problem Entropy measure for convex projective manifolds.
method Developed Patterson--Sullivan densities and mixing theory.
result Unique mixing measure of maximal entropy exists.
Geodesics in curved spaces spread evenly over time.
problem Equidistribution of geodesics in negatively curved spaces.
method Proving equidistribution of geodesic flow orbits towards measures of maximal entropy and Bowen-Margulis measure.
result Equidistribution of divergent geodesics in negative curvature as their complexity increases.
Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.
problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.
Paper proposes a new method to learn distribution kernels via entropy maximization.
problem Challenges in applying kernel methods to distribution regression tasks.
method Proposes a novel objective for unsupervised learning of data-dependent distribution kernels based on entropy maximization.
result Demonstrates the effectiveness of the learned kernel across different modalities.
New RL approach uses future state and action visitation measures for better exploration.
problem Improving exploration in reinforcement learning.
method Intrinsic reward based on future state and action visitation measures, using contraction operators.
result Policies achieve good state-action space coverage and high performance.
Paper introduces a new measure combining entropy and Gini index.
problem Quantifying complexity in socio- and econo-physics.
method Generalizes entropy using Gini index and Lorenz curve transformation.
result Supports quantifying complexity in socio- and econo-physics.
Symbolic dynamics for flows in high dimensions, extending previous work.
problem Coding flows with positive speed in high dimensions.
method Construct symbolic dynamics for flows with positive speed in any dimension.
result Extended symbolic dynamics to flows in high dimensions, including homoclinic classes.
Let {Tt} be a smooth flow with positive speed and positive topological entropy on a compact smooth three dimensional manifold, and let μ be an ergodic measure of maximal entropy. We show that either {Tt} is Bernoulli, or {Tt} is isomorphic to the product of a Bernoulli flow and a rotational flow. Appli…
Study of non-archimedean μ-entropy and its connection to K-stability.
problem Understanding K-stability in non-archimedean settings.
method Introducing non-archimedean μ-entropy and its properties, connecting it to K-semistability.
result Established a criterion for K-semistability without vector ξ, using the non-archimedean μ-entropy.
We define a generalized likelihood function based on uncertainty measures and show that maximizing such a likelihood function for different measures induces different types of classifiers. In the probabilistic framework, we obtain classifiers that optimize the cross-entropy function. In the possibilistic framework, we …
Minimal surfaces and average area ratio found to be maximized by hyperbolic metrics.
problem Finding sharp relations between minimal surface entropy and average area ratio.
method Ricci flow with surgery and invariant measures.
result Minimal surface entropy maximized by hyperbolic metrics among metrics with scalar curvature ≥ -6.
Holomorphic automorphisms on hyperkähler manifolds with high entropy are Kummer examples.
problem Characterizing holomorphic automorphisms with high entropy on hyperkähler manifolds.
method Using Jensen's inequality and properties of stable and unstable distributions, the authors show uniform contraction and expansion, leading to the conclusion that the manifold is birational to a torus quotient.
result Holomorphic automorphisms with high entropy on hyperkähler manifolds are Kummer examples.
Proposes MEDM to balance entropy minimization and diversity maximization for better domain adaptation.
problem Trivial solutions in entropy minimization for unsupervised domain adaptation.
method Introduces diversity maximization to balance with entropy minimization, controlled by deep embedded validation.
result MEDM outperforms state-of-the-art methods on four domain adaptation datasets.
The paper studies minimal surface entropy on hyperbolic 3-manifolds and compares it to the hyperbolic case.
problem Minimal surface entropy on hyperbolic 3-manifolds and its comparison to the hyperbolic case.
method Analysis of Ricci flow convergence and comparison of metrics with sectional and scalar curvature constraints.
result The entropy is maximized at the hyperbolic metric under certain curvature conditions.
New method speeds up lead-lag detection between asynchronous time series.
problem Slow inference of lead-lag networks between long time series.
method Derive asymptotic distribution of Transfer Entropy and introduce time-shifted time series.
result Statistically validated lead-lag networks between time series.
We prove the existence of manifolds with almost maximal volume entropy which are not hyperbolic.
We study simple root flows and Liouville currents for Hitchin representations. We show that the Liouville current is associated to the measure of maximal entropy for a simple root flow, derive a Liouville volume rigidity result, and construct a Liouville pressure metric on the Hitchin component.
A new copula, the checkerboard copula, maximizes entropy and preserves dependence.
problem Choosing copula for non-continuous marginal distributions.
method Introducing the checkerboard copula, maximizing Shannon entropy.
result Checkerboard copula maximizes entropy and preserves dependence.
New algorithm estimates semi-continuous data density using entropy maximization.
problem Estimating density functions for semi-continuous data.
method Maximum entropy principle, requiring only constraint function samples.
result Estimate has significantly less bias compared to existing methods.
Maximizes coding rate difference for robust, discriminative features.
problem Learning robust, discriminative features from high-dimensional data.
method Maximal Coding Rate Reduction (MCR^2) principle.
result Significantly more robust to label corruptions in classification.
Improved pre-trained embeddings through effective entropy maximization.
problem Developing high-quality pre-trained embeddings for future tasks.
method E2MC criterion defined in terms of low-dimensional constraints.
result Significant improvement in downstream performance.
Paper proposes a new uncertainty measure for active learning in neural networks.
problem Efficiently selecting informative data points in limited labeled data scenarios.
method BalEntAcq, a new uncertainty measure based on balanced entropy, approximated by Beta distributions.
result BalEntAcq outperforms existing uncertainty measures in active learning.
In this paper we study the ergodic theory of the geodesic flow on negatively curved geometrically finite manifolds. We prove that the measure theoretic entropy is upper semicontinuous when there is no loss of mass. In case we are losing mass, the critical exponents of parabolic subgroups of the fundamental group have a…
Williams and Beer (2010) proposed a nonnegative mutual information decomposition, based on the construction of redundancy lattices, which allows separating the information that a set of variables contains about a target variable into nonnegative components interpretable as the unique information of some variables not p…
The study counts geodesics on special manifolds without focusing points.
problem Counting geodesics on specific types of manifolds.
method Margulis-type asymptotic estimates and analysis of geodesic flow.
result The geodesic flow on these manifolds has a unique measure of maximal entropy with the Bernoulli property.
The paper introduces submodular information measures for machine learning applications.
problem Generalizing information-theoretic measures to non-random variables.
method Developing combinatorial information measures based on submodular functions.
result Submodular mutual information is submodular in one argument for certain submodular functions.
The concept of refinement from probability elicitation is considered for proper scoring rules. Taking directions from the axioms of probability, refinement is further clarified using a Hilbert space interpretation and reformulated into the underlying data distribution setting where connections to maximal marginal diver…
Gathering the most information by picking the least amount of data is a common task in experimental design or when exploring an unknown environment in reinforcement learning and robotics. A widely used measure for quantifying the information contained in some distribution of interest is its entropy. Greedily minimizing…
TES optimizes black-box functions efficiently with minimal approximations.
problem Efficient Bayesian optimization with minimal approximations and generalization to batch BO.
method TES acquisition function measures information gain on trusted maximizers.
result TES achieves state-of-the-art performance with minimal approximations.
Estimate relaxation times in nonextensive systems using gradient flow for Tsallis entropy maximization.
problem Estimating relaxation times in financial market dynamics.
method Developing a method using EGF for maximizing Tsallis entropy.
result Longer relaxation times for nonextensive systems compared to Shannon entropy.
Investing is a compression problem, maximizing growth by minimizing divergence.
problem Maximizing long-term wealth and minimizing risk of ruin in investing.
method Decomposes investing into three terms: money, entropy, and divergence. Uses Kelly Criterion and universal portfolio theory.
result Investing can be seen as a compression problem, with optimal strategies minimizing divergence.
Maximizes mixing efficiency in surface braids.
problem Finding the maximum mixing efficiency in surface braids.
method Introduced an efficient algorithm to compute topological entropy and TEPO for surface braids.
result Conjectured a novel candidate braid to have maximal mixing efficiency.
We give an alternative proof of a result of Cantat and Dupont, showing that any automorphism of a K3 surface with measure of maximal entropy in the Lebesgue class must be a Kummer example. Our method exploits the existence of Ricci-flat metrics on K3s and also covers the non-projective case.
Quantitative rigidity theorem for Alexandrov spaces with curvature bounds.
problem Quantifying rigidity in Alexandrov spaces with curvature constraints.
method Using Gromov-Hausdorff distance and properties of Alexandrov spaces.
result Alexandrov spaces with curvature bounds are close to hyperbolic manifolds.
NDI learns from expert demonstrations by estimating occupancy measures.
problem Imitation Learning (IL) for complex systems.
method Density estimation of expert's occupancy measure followed by RL.
result NDI achieves state-of-the-art performance on control tasks.
Paper proposes a policy-search algorithm to learn entropy-maximizing exploration policies in reward-free environments.
problem Reward-free learning in high-dimensional, continuous-control domains.
method Maximum Entropy POLicy optimization (MEPOL) algorithm that maximizes a non-parametric state entropy estimate.
result MEPOL learns a maximum-entropy exploration policy that facilitates learning various reward-based tasks.
Density destructors simplify complex PDFs to maximize entropy, linking to information theory.
problem Complex multivariate PDFs are hard to analyze.
method Invertible transforms that progressively remove structure from PDFs.
result Density destructors can improve estimates of information theoretic quantities.
We establish a precise asymptotic formula for the number of homotopy classes of periodic orbits for the geodesic flow on rank one manifolds of nonpositive curvature. This extends a celebrated result of G. A. Margulis to the nonuniformly hyperbolic case and strengthens previous results by G. Knieper. We also establish s…
We introduce an algorithm to locate contours of functions that are expensive to evaluate. The problem of locating contours arises in many applications, including classification, constrained optimization, and performance analysis of mechanical and dynamical systems (reliability, probability of failure, stability, etc.).…
Measures neural network complexity using tangent space diversity.
problem Estimating the true complexity of neural networks.
method Entropy-based measure of tangent spaces from different inputs.
result Captures effective complexity, not just theoretical capacity.