Sharp concentration bounds for i.i.d. variables.
problem Controlling the tail probabilities of independent variables.
method Extension of Sanov's theorem using large deviations and information theory.
result Matching concentration and anti-concentration bounds for i.i.d. samples of any size.
Information concentration of probability measures have important implications in learning theory. Recently, it is discovered that the information content of a log-concave distribution concentrates around their differential entropy, albeit with an unpleasant dependence on the ambient dimension. In this work, we prove th…
This work uses statistical mechanics to explain AI learning.
problem Understanding the statistical principles behind AI learning.
method Starting from sample concentration behaviors, the study applies statistical mechanics principles to AI and machine learning.
result Exponential families and statistical quantities are key in AI and machine learning.
Study provides bounds for estimating intrinsic dimension using Gaussian kernels.
problem Estimating intrinsic dimension from data.
method Finite-sample concentration and anti-concentration bounds for Gaussian kernel sums.
result Explicit dependence on sample size, bandwidth, and geometric parameters.
Physics-informed neural networks improve subsurface transport parameter estimation from sparse data.
problem Estimating subsurface transport parameters from sparse measurements.
method Physics-informed neural networks (DNNs) for joint inversion of conductivity, hydraulic head, and concentration fields.
result Physics-informed DNNs yield significantly more accurate parameter estimates than standard DNNs.
The study examines how investor protection and past information affect stock returns and interest rates.
problem Empirical regularities related to investor protection and past information in asset pricing models.
method Developed a dynamic asset pricing model with a controlling shareholder and good/bad memory in budget dynamics.
result Good/bad memory of investors on historical market information affects stock returns and interest rates, strengthening investor protection in high ownership concentration.
In this paper we study the local regularity of closed surfaces immersed in a Riemannian 3-manifold flowing by Willmore flow. We establish a pair of concentration-compactness alternatives for the flow, giving a lower bound on the maximal time of existence of the flow proportional to the concentration of the curvature an…
Kernel networks' stability edge linked to Fisher Information singularity.
problem Understanding the stability edge in high-capacity kernel Hopfield networks.
method Statistical manifold analysis and Riemannian geometry.
result The Ridge of Optimization corresponds to the Edge of Stability, revealing a dual equilibrium.
New methods correct spectral distortions using known analyte concentrations.
problem Distorted spectral shapes from absorbing and scattering contributions.
method Modified penalized baseline correction methods that incorporate known analyte concentrations.
result Improved prediction performance on near infra-red data sets.
This work explores the characteristics of financial contagion in networks whose links distributions approaches a power law, using a model that defines banks balance sheets from information of network connectivity. By varying the parameters for the creation of the network, several interbank networks are built, in which …
Paper shows how gradient concentration helps in learning from inexact data.
problem Learning from inexact and stochastic training data.
method Combines probabilistic gradient concentration with inexact optimization techniques.
result Derives sharp test error guarantees for learning.
Paper introduces information-constrained optimal transport, generalizing Talagrand's inequality.
problem Optimal transport problem with information constraints.
method Information constrained variation of optimal transport, using Marton's approach.
result Recovery of concentration of measure results and solution to Cover's open problem.
The paper analyzes different neural network architectures for 3D point cloud processing.
problem Understanding the effects of specific intermediate-layer network architectures on 3D point cloud processing.
method Designing five metrics to diagnose various types of DNNs and conducting comparative studies.
result The hypotheses on the effects of specific intermediate-layer network architectures on the representation capacity of DNNs are verified.
Unified framework for measuring concentration in weighted networks considering both weight distributions and network structure.
problem Traditional indices neglect the topology of relationships among network elements.
method Develops a family of topology-aware concentration indices that jointly account for weight distributions and network structure.
result The proposed indices preserve key properties and allow concentration to be evaluated across different dimensions of dependence.
This paper treats prediction markets as Bayesian inverse problems to quantify uncertainty and identify event outcomes.
problem Uncertainty and identifiability in prediction market outcomes from price-volume histories.
method Formulates prediction markets as Bayesian inverse problems, introduces a log-odds observation model, and derives posterior uncertainty quantification and identifiability criteria.
result Explicit diagnostics for informative and stable inference regimes, and validation through synthetic data experiments.
Uncertainty principles such as Heisenberg's provide limits on the time-frequency concentration of a signal, and constitute an important theoretical tool for designing and evaluating linear signal transforms. Generalizations of such principles to the graph setting can inform dictionary design for graph signals, lead to …
Reduced-order model improves LES for atmospheric pollutant dispersion.
problem Accurate near-field pollutant concentration tracking in urban areas.
method Combining POD and GPR for non-intrusive reduced-order modeling.
result Component-by-component optimization captures spatial scales in high-order modes.
When the available statistical information is imperfect, it is dangerous to follow standard optimisation procedures to construct an optimal portfolio, which usually leads to a strong concentration of the weights on very few assets. We propose a new way, based on generalised entropies, to ensure a minimal degree of dive…
This paper analyzes various forms of concentrated liquidity in decentralized finance.
problem Understanding different models of concentrated liquidity in DeFi.
method Algebraic and geometric analysis of existing models.
result An authoritative overview of concentrated liquidity models in DeFi.
Study examines market response to concentrated policy communication using entropy measures.
problem Characterizing market response under concentrated policy communication.
method Jointly examines dispersion and information complexity (entropy) using sliding window cumulative entropy.
result Entropy captures both market volatility and narrative constraints, signaling coherent policy-driven moves.
We analyze a plug-in estimator for a large class of integral functionals of one or more continuous probability densities. This class includes important families of entropy, divergence, mutual information, and their conditional versions. For densities on the d-dimensional unit cube [0,1]d that lie in a β-Hölder s…
Kernel methods are successful approaches for different machine learning problems. This success is mainly rooted in using feature maps and kernel matrices. Some methods rely on the eigenvalues/eigenvectors of the kernel matrix, while for other methods the spectral information can be used to estimate the excess risk. An …
Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.
problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.
Random feature matrices' singular values concentrate near their full expectation in high dimensions.
problem Characterizing the spectra of random feature matrices for regression problems.
method Analyzing two settings of input variables (random or well-separated) with conditions on dimension, complexity ratio, and sampling variance.
result The singular values of random feature matrices concentrate near their full expectation and near one with high probability.
Proposes methods for local clustering in attributed graphs.
problem Finding a single cluster concentrated on a specific region in a graph.
method Introduces Graph Unimodality (GU) and Attribute Unimodality (AU) measures, and LOCLU algorithm to optimize Compactness score.
result Local cluster detected by LOCLU concentrates on the region of interest and exhibits unimodal data distribution.
The paper proves concentration inequalities for two-sample rank processes and applies them to ranking performance criteria.
problem Measuring the performance of ranking statistics between two populations.
method Proves concentration inequalities for two-sample rank processes indexed by VC classes of scoring functions.
result Generalization capacity of empirical maximizers of ranking performance criteria is investigated.
Quantitative modeling of post-transcriptional regulation process is a challenging problem in systems biology. A mechanical model of the regulatory process needs to be able to describe the available spatio-temporal protein concentration and mRNA expression data and recover the continuous spatio-temporal fields. Rigorous…
Method captures shared information across many views robustly.
problem Modeling hundreds of views per event and learning robust embeddings without view knowledge.
method View bootstrapping using multi-view correlation and matrix concentration theory.
result View bootstrapping captures shared information across many views robustly.
Bayesian PINNs learn elliptic PDEs with near-minimax posterior contraction rate.
problem Learning elliptic PDEs with noisy data and non-homogeneous boundary conditions.
method Bayesian approach with a Hölder space prior on neural network weights.
result Posterior contracts at near-minimax rate without prior knowledge of solution smoothness.
Paper proposes a transfer learning method for improving matrix completion.
problem Improving estimation of a low-rank target matrix using auxiliary data.
method Transfer learning procedure leveraging prior information on favorable source datasets.
result Method outperforms traditional methods when source datasets are close to the target matrix.
New method uses machine learning to estimate drug parameters in brain models.
problem Estimating unknown parameters in complex brain drug models.
method Physics-Informed Neural Networks (PINNs) for inverse problem solving.
result Accurate parameter estimation leads to precise drug concentration profiles.
Theory for algebraic data on categories via concentration structures.
problem Defining algebraic structures on categories.
method Introducing concentration structures and concentration monoids.
result Every group can be represented as a concentration monoid of a trivial category.
Improved location estimation for high-dimensional data with finite sample size.
problem Estimating the shift in high-dimensional data with limited samples.
method Smoothed estimators and bounds on subgamma vectors.
result Convergence to Cramér-Rao bound for finite sample sizes.
Paper addresses concentration of distances for fractional quasi p-norms, identifying conditions for concentration and anti-concentration.
problem Understanding concentration of distances for fractional quasi p-norms in high dimensions.
method Analyzes conditions for concentration and anti-concentration of distances for fractional quasi p-norms.
result Identifies conditions for concentration and anti-concentration of fractional quasi p-norms, ruling out some approaches and specifying conditions for control.
Study Finsler metric measure manifolds' concentration properties.
problem Understanding concentration properties in Finsler metric measure manifolds.
method Established relationships with observable diameter, isoperimetric inequalities, and first eigenvalue.
result Derived a Cheng type upper bound estimate for the first closed eigenvalue.
Paper identifies key function spaces for ReLU networks based on Fisher information.
problem Understanding the structure of Fisher information matrices in ReLU networks.
method Spectral decomposition of Fisher information matrices, focusing on the first three eigenspaces.
result The first three eigenspaces account for 97.7% of the trace of the Fisher information matrix, corresponding to spherical harmonic functions of order ≤2.
New method improves missing mass concentration bounds.
problem Missing mass concentration problem
method New method of estimating concentration of heterogenic sums
result Slightly improved state-of-the-art bounds
Surfaces in 3-manifolds concentrate at curvature critical points.
problem Understanding concentration of surfaces in 3-manifolds.
method Proving surfaces concentrate at critical points of scalar curvature.
result Simply connected H-surfaces concentrate at curvature critical points.
Algorithm optimizes a single attribute in multi-armed bandits with constraints.
problem Optimizing a single attribute under multiple constraints in multi-armed bandits.
method Successive Rejects framework, information theoretic lower bound.
result Upper bound on probability of error decays exponentially with budget, nearly optimal in certain cases.
We survey recent results related to the concentration of eigenfunctions. We also prove some new results concerning ball-concentration, as well as showing that eigenfunctions saturating lower bounds for L1-norms must also, in a measure theoretical sense, have extreme concentration near a geodesic.
New method improves uncertainty calibration in deep learning.
problem Systematic overconfidence in EDL on out-of-distribution inputs.
method Density-Informed Pseudo-count EDL (DIP-EDL) separates class prediction from uncertainty.
result DIP-EDL achieves asymptotic concentration and enhances robustness and uncertainty calibration.
A new model CDTM improves text classification by concentrating document topics.
problem Unsupervised text classification with diverse topic distributions.
method Imposes an exponential entropy penalty on document topic distribution to encourage concentration.
result More coherent topics and concentrated, sparse document-topic distributions.
Simplified proof of Gaussian concentration inequality using covariance.
problem Gaussian concentration inequality proof
method Covariance representation based on characteristic functions
result Elementary proof of Gaussian concentration inequality
Study on inequalities for multinomial variables.
problem Understanding concentration inequalities for multinomial variables.
method Investigation of Dirichlet and Multinomial random variables.
result Results on concentration inequalities for multinomial variables.
Physics-Informed Neural Networks (PINNs) benchmarked against clinical estimator and reveal parameter identifiability
problem Chemotherapy pharmacokinetics (PK) with tissue concentration not measured
method Physics-Informed Neural Networks (PINNs) benchmarked against clinical estimator and reveal parameter identifiability
result PINN recovers tissue concentration and identifies non-identifiable parameters
Developed concentrated liquidity in n-dimensional AMM with polar coordinates in Rust.
problem Risk of stacking too many stablecoin pools.
method Building concentrated liquidity positions with ticks in polar coordinates in Rust.
result Hedging risk of stacking stablecoin pools.
In this paper, we consider a concentration of measure problem on Riemannian manifolds with boundary. We study concentration phenomena of non-negative 1-Lipschitz functions with Dirichlet boundary condition around zero, which is called boundary concentration phenomena. We first examine relation between boundary concen…
Study on volume of tubes and concentration in Riemannian geometry.
problem Understanding concentration loci in Riemannian manifolds and their relation to tube volumes.
method Provided a general formula for tube volumes, specialized to totally geodesic submanifolds, and investigated concentration loci.
result Explicitly proved concentration for codimension one cases and explored characterizations in Wasserstein and Box distances.