The paper calculates bounds for risk metrics and entropies under partial information constraints.
problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.
The paper analyzes worst-case distortion risk metrics and weighted entropy under partial information.
problem Analyzing worst-case distortion risk metrics and weighted entropy with limited information.
method General distributions, partial information (mean and variance), various entropies and risk measures.
result Provides worst-case results for distortion risk metrics and weighted entropy.
Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.
problem Understanding how LLMs internalize statistical structure during next-token prediction.
method Cumulant-expansion framework treating softmax entropy as perturbation around center distribution.
result Cumulants reveal distinct signatures for mathematical vs. general text prompts, quantifying feature-learning dynamics.
Enhances RL by controlling policy stochasticity through trajectory entropy constraints.
problem Non-stationary Q-value estimation and short-sighted entropy tuning in maximum entropy RL.
method Proposes TECRL framework with separate Q-functions for reward and entropy, enforcing a trajectory entropy constraint.
result DSAC-E algorithm achieves higher returns and better stability on OpenAI Gym benchmarks.
Method determines credit transition matrix from cumulative default probabilities.
problem Quantifying changes in bond credit ratings.
method Setup an ill-posed, linear inverse problem with entropy minimization.
result Method successfully determines CTM from cumulative default probabilities.
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.
Study uses information-theoretic measures to analyze neural networks and neuron importance.
problem Understanding the importance of individual neurons in neural networks.
method Cumulative ablation of neurons, analyzing entropy, mutual information, and class selectivity.
result Class selectivity is not a good indicator for classification performance, while mutual information and selectivity are positively correlated with performance.
The paper studies empirical processes from nearest neighbors in regression.
problem Estimating conditional cumulative distribution functions and local linear regression.
method Uniform central limit theorem and non-asymptotic bound under local bracketing entropy and uniform entropy numbers.
result Gaussian limit of empirical process with simple covariance.
Evidence found for critical behavior in financial data.
problem Understanding the statistical properties of financial markets.
method Analysis of normalized return distributions for top companies, modeling with q-Gaussians.
result Monotonic relationship between q and β, indicating critical behavior.
New meta-optimizer learns from both point-based and population-based algorithms.
problem Current meta-optimizers are limited in space and unaware of uncertainty.
method Proposes a new meta-optimizer that learns in the space of both point-based and population-based algorithms, targeting a meta-loss function of cumulative regret and entropy.
result Empirical results show superior performance over existing competitors.
DE-QT detects optimal Q-learning stopping points.
problem Information loss in Q-learning during prolonged training.
method Introducing DE-QT to detect entropy changes in Q-tables.
result DE-QT identifies the best stopping point for Q-learning.
Proposes a new model for stock and dividend derivatives pricing.
problem Pricing stock and dividend derivatives with positive stock prices and non-negative dividends.
method Jointly specifies dynamics for stock price and dividend rate, using mean-reverting dividend rate.
result Closed-form expressions for stock and dividend futures prices, accurate option approximations.
Study shows how market firm capitalization models converge to stochastic PDE solutions.
problem Understanding convergence of rank-based models with common noise to stochastic PDE solutions.
method Analysis of mean field limit, martingale problem, and pathwise entropy solutions.
result Empirical cumulative distribution function converges to solution of a stochastic PDE under certain conditions.
New algorithms minimize regret in both adversarial and stochastic contexts.
problem Minimizing regret in linear contextual bandits.
method Best-of-both-worlds algorithms using FTRL with Shannon entropy regularizer.
result Achieves near-optimal regret bounds in both adversarial and stochastic regimes.
AI learns to classify and represent univariate distributions in a 2D latent space.
problem Classifying and representing univariate empirical distributions.
method Unsupervised beta variational autoencoder (beta-VAE) to separate and represent distributions in a 2D latent space.
result The latent space representation separates distributions of different shapes while overlapping similar ones.
Entropy measure assesses market volatility and price heterogeneity.
problem Quantifying short-term market heterogeneity in financial time series.
method Entropy measure based on intersecting a random sequence with its moving average.
result Entropy of volatility series varies by market, while price series is market-invariant.
We investigate the position of the Buchen-Kelly density in a family of entropy maximising densities which all match European call option prices for a given maturity observed in the market. Using the Legendre transform which links the entropy function and the cumulant generating function, we show that it is both the uni…
Study examines how war impacts financial entropy.
problem Analyzing sudden events' impact on financial markets.
method Investigates entropy changes in Polish stock market data.
result Entropy analysis reveals market changes due to extreme events.
UDS measures multivariate correlations across any dimensionality.
problem Discovering significant correlations in multi-dimensional data.
method UDS based on cumulative entropy, normalized for comparison across subspaces.
result UDS efficiently captures both linear and non-linear correlations.
Mutual-information regularization improves RL algorithms, especially in high-dimensional domains.
problem Value overestimation and exploration in reinforcement learning.
method Developed a novel mutual-information regularized actor-critic learning (MIRACLE) algorithm.
result MIRACLE outperforms state-of-the-art algorithms in continuous action spaces.
Analytical model prices options with moving barriers under non-Gaussian distributions.
problem Pricing options with moving barriers under non-Gaussian distributions.
method Path-integral formalism adapted from galaxy formation models, incorporating higher-order cumulants.
result Analytical pricing model for vanilla and barrier options without volatility smile.
Effective nonparametric anomaly detection for high-dimensional data.
problem Timely detection of abrupt anomalies in high-dimensional data.
method Nonparametric algorithms using univariate summary statistics and submanifold learning.
result Asymptotic guarantees for accurate anomaly detection.
Entropy-based decoding improves DLM sampling efficiency.
problem Decoding strategy challenges in flexible DLMs.
method Entropy sum-based confidence-based decoding.
result Entropy sum-based decoding achieves ε \varepsilon ε -accuracy with O ~ ( H ( X 0 ) / ε ) \widetilde O(H(X_0)/\varepsilon) O ( H ( X 0 ) / ε ) iterations. Paper introduces DTAE to optimize RL algorithms, balancing exploration and exploitation.
problem Balancing exploration and exploitation in reinforcement learning.
method Soft policy optimization with entropy and dual-track advantage estimator (DTAE).
result DTAE accelerates RL algorithm convergence and improves performance.
New method learns stochastic thermodynamics from system currents.
problem Understanding entropy production in complex dynamical systems.
method Constructs learning framework using currents and machine learning loss functions.
result Derives loss functions for thermodynamic functions directly from dynamics.
New method for neural networks to predict histogram data.
problem Lack of principled approach for histogram regression.
method Pinball loss applied to cumulative histogram.
result Accuracy similar to EMD with less computational cost.
Ancestry improves genealogy search results by ranking diverse record types.
problem Ranking diverse genealogy records equitably from various sources.
method Customized Coordinate Ascent, Stochastic Search, Normalized Cumulative Entropy.
result Demonstrated effectiveness of algorithms in improving relevance and diversity.
The paper develops approximations for Pearson's chi-square statistic and applies them to confidence intervals.
problem Finding confidence intervals for strictly convex functions of discrete distribution weights.
method Non-asymptotic local normal approximation for multinomial probabilities, deriving bounds and coupling inequalities.
result Developed methods to find confidence intervals for negative entropy of discrete distributions.
This paper reformulates F β F_β F β for better model performance and interpretation.
problem Optimizing model performance and interpretation using F β F_β F β metric. method Reformulate F β F_β F β metric to facilitate statistical distributions and dynamic penalty weights. result Better and interpretable results with a 14% boost in F 1 F_1 F 1 score for IMDB data. Study on Bayesian reinforcement learning performance bounds.
problem Achieving optimal performance in model-based Bayesian reinforcement learning.
method Defining minimum Bayesian regret, deriving upper bounds using relative entropy and Wasserstein distance, and applying these to specific MDP cases.
result Upper bounds on minimum Bayesian regret for MDPs, including specific cases like MAB and online optimization with partial feedback.
This paper extends financial theory to measure learnable market structure under computational constraints.
problem Understanding learnable market structure under bounded computational capacity.
method Introduces financial epiplexity as a measure of learnable market structure, extending classical information theory.
result Proves that equal entropy does not imply equal epiplexity and derives thresholds for useful regimes.
The CSA-ES is an Evolution Strategy with Cumulative Step size Adaptation, where the step size is adapted measuring the length of a so-called cumulative path. The cumulative path is a combination of the previous steps realized by the algorithm, where the importance of each step decreases with time. This article studies …
Using methods introduced by Scargle in 1978 we derive a cumulative version of the Lomb periodogram that exhibits frequency independent statistics when applied to cumulative noise. We show how this cumulative Lomb periodogram allows us to estimate the significance of log-periodic signatures in the S&P 500 anti-bubble th…
The paper tackles optimal stopping problems using reinforcement learning and singular control.
problem Continuous-time and state-space optimal stopping problems.
method Formulated as a singular control problem with randomized stopping times and penalized cumulative residual entropy.
result Identified unique optimal exploratory strategy through dynamic programming.
Tree Index evaluates cluster quality by creating decision trees from data.
problem Evaluating the quality of cluster results from various techniques.
method Tree Index creates a decision tree from clustered data, combining entropy and depth of leaves.
result Tree Index discriminates between sensible and non-sensible clusters on brain dataset.
Kernelized cumulants improve statistical analysis in high-dimensional spaces.
problem Statistical analysis in high-dimensional spaces with low variance estimators.
method Extending cumulants to RKHS using tensor algebra and kernel trick.
result Kernelized cumulants provide new all-purpose statistics with computational tractability.
Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.
problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.
A new GAN loss function based on cumulant generating functions improves stability and robustness.
problem Improving the stability and performance of GANs.
method Cumulant GAN loss function based on variational R{é}nyi divergence.
result Cumulant GAN achieves linear convergence to Nash equilibrium and superior performance in image generation.
Proposes a curriculum learning algorithm to maximize cumulative return in reinforcement learning.
problem Maximizing cumulative return in reinforcement learning tasks.
method Task sequencing algorithm maximizing cumulative return, using curriculum learning to minimize suboptimal actions.
result Significantly better performance on cumulative return maximization compared to metaheuristic algorithms.
Bayesian methods improve inference for cumulative probit models on large datasets.
problem Challenges in Bayesian inference for large cumulative probit models.
method Proposed scalable algorithms using Variational Bayes and Expectation Propagation.
result Superior computational performance and accuracy compared to MCMC.
The problem of an arbitrary truncated Levy flight description using the method of cumulant approach has been solved. The set of cumulants of the truncated Levy distribution given the assumption of arbitrary truncation has been found. The influence of truncation shape on the truncated Levy flight properties in the Gauss…
CENNSurv models cumulative effects of time-dependent exposures on survival outcomes.
problem Challenges in modeling cumulative effects of time-dependent exposures on survival outcomes.
method CENNSurv, a novel deep learning approach that captures dynamic risk relationships from time-dependent data.
result CENNSurv reveals multi-year lagged and short-term behavioral shifts in survival outcomes.
Paper calculates volatility distribution for cumulative production.
problem Volatility distribution for cumulative production.
method Generalizes study of volatility with arbitrary distribution function.
result Exact probability distribution function for volatility.
Develops a cumulant-based algorithm for optimizing investment portfolios.
problem Optimizing investment portfolios with low variability in non-Gaussian data.
method Alternating Least Square method applied to 2nd-6th cumulants of multidimensional random variables.
result The algorithm outperforms benchmarks and other methods during recent crashes.
New algorithms minimize simple and cumulative regret in contextual bandits.
problem Minimizing simple and cumulative regret in contextual bandit settings.
method Proposed new algorithms using conformal arm sets (CASs).
result Near-optimal minimax guarantees for simple regret and state-of-the-art guarantees for cumulative regret.
New method calibrates classifier probabilities with guaranteed coverage.
problem Inaccurate probability estimates by classifiers in high-risk applications.
method Adaptive temperature scaling algorithm for conformal prediction.
result Improves calibration error measures and standard metrics across various tasks.
Paper converts quantiles to cumulative distribution functions to simplify risk measures.
problem Technical assumptions in risk measure calculations.
method Invention of converting integrated quantiles to integrated cumulative distribution functions.
result Avoids the need for probability density function existence.
We introduce a new type of graphical model called a "cumulative distribution network" (CDN), which expresses a joint cumulative distribution as a product of local functions. Each local function can be viewed as providing evidence about possible orderings, or rankings, of variables. Interestingly, we find that the condi…