The financial market entropy is modeled using open quantum systems.
problem Understanding entropy in financial market dynamics.
method Using Open Quantum Systems to model entropy gain in financial markets.
result Interesting non-classical results generated by relaxing assumptions.
Develops a new measure for market efficiency based on informational-entropy.
problem Lack of a precise quantitative definition of market efficiency.
method Develops a measure based on informational-entropy.
result The new measure is equivalent to existing definitions of market efficiency.
The paper characterizes probability and entropy of exponentially growing sample spaces.
problem Characterizing probability and entropy of exponentially growing sample spaces.
method Analytical and applied to real-world data (US$ broad money supply).
result Information entropy is related to the rate of sample space expansion.
Investigates the relationship between US money supply and asset indices over 2001-2019.
problem Determining the relationship between US money supply and asset indices growth.
method Information entropy methodology applied to US asset indices (Property, Russell 2000, S&P 500, NASDAQ) over 2001-2019.
result Growth in US broad money supply is the main determinant of US asset indices growth, especially the NASDAQ and Russell 2000.
A new method balances accuracy and diversity in ensemble pruning.
problem Balancing accuracy and diversity in ensemble learning.
method Formalizing ensemble pruning as an objection maximization problem based on information entropy, proposing a distributed framework.
result Achieves less time-consuming execution with minimal accuracy degradation.
A family of replicator-like dynamics, called the escort replicator equation, is constructed using information-geometric concepts and generalized information entropies and diverenges from statistical thermodynamics. Lyapunov functions and escort generalizations of basic concepts and constructions in evolutionary game th…
The paper introduces tools to assess data transformation quality using information entropy.
problem Assessing the quality of data transformations in machine learning tasks.
method Introduces a decomposition of maximal potential entropy into non-transferable, transferable but not transferred, and transferred parts.
result Developed a visual exploratory tool called the Channel Multivariate Entropy Triangle to assess information transfer efficiency.
In this paper we aim to find a measure for the diversity of cash flows between agents in an economy. We argue that cash flows can be linked to probabilities of finding a currency unit in a given cash flow. We then use the information entropy as a natural measure of diversity. This leads to a hirarchical inequality meas…
Detailed study of the financial empirical correlation matrix of the 30 companies comprised by DAX within the period of the last 11 years, using the time-window of 30 trading days, is presented. This allows to clearly identify a nontrivial time-dependence of the resulting correlations. In addition, as a rule, the draw d…
We discuss the behavior of two magnitudes, physical complexity and mutual information function of the outcome of a model of heterogeneous, inductive rational agents inspired in the El Farol Bar problem and the Minority Game. The first is a measure rooted in Kolmogorov-Chaitin theory and the second one a measure related…
The paper clarifies that embeddings can either reduce or maintain the dimensionality of sparse feature spaces.
problem Misconception about embedding dimensionality in sparse feature spaces.
method Analysis of information entropy and upper bounds for embedding dimensions.
result Embeddings can either reduce or maintain the dimensionality of sparse feature spaces, providing a meaningful representation.
In the market place, diversification reduces risk and provides protection against extreme events by ensuring that one is not overly exposed to individual occurrences. We argue that diversification is best measured by characteristics of the combined portfolio of assets and introduce a measure based on the information en…
The principle of absence of arbitrage opportunities allows obtaining the distribution of stock price fluctuations by maximizing its information entropy. This leads to a physical description of the underlying dynamics as a random walk characterized by a stochastic diffusion coefficient and constrained to a given value o…
Four enhanced SMOTE methods improve accuracy on imbalanced datasets.
problem Balancing imbalanced datasets for better learning algorithm performance.
method Improved SMOTE with mutual information weights and different entropies.
result Enhanced SMOTE methods outperform previous techniques on 11 datasets.
Bayesian-SINDy learns differential equations from noisy data quickly.
problem Learning correct model equations from limited and noisy data.
method Bayesian-SINDy framework using Gaussian approximations.
result Bayesian-SINDy is more robust and accurate in learning correct model equations from noisy data.
Estimates interactions between modalities for multimodal data.
problem Accurately quantifying interactions between different data types.
method Developed Lightweight Sample-wise Multimodal Interaction (LSMI) estimator using pointwise information theory.
result LSMI reveals fine-grained dynamics in multimodal data.
Our work proves CSF can recover ground-truth features in RL, improving understanding of feature learning.
problem Understanding the role of representation and mutual information in reinforcement learning.
method Investigates Contrastive Successor Features (CSF) method for identifiable representation learning in reinforcement learning.
result Proves CSF can recover ground-truth features up to a linear transformation.
PiNGDA learns beneficial noise for graph augmentation stability.
problem Challenges in generating effective and stable graph augmentations.
method PiNGDA uses positive-incentive noise to scientifically analyze and generate beneficial graph augmentations.
result PiNGDA improves GCL performance by learning beneficial noise on graph topology and attributes.
INGB improves oversampling for noisy imbalanced datasets.
problem Imbalanced, noisy, and complex datasets in classification problems.
method INGB uses granular balls to simulate spatial distribution and informed entropy for optimization, followed by nonlinear oversampling.
result INGB outperforms traditional linear sampling frameworks and algorithms on complex datasets.
A new mutual information lower bound for multimodal regression active learning.
problem Lack of effective acquisition functions for multimodal regression active learning.
method Introduces a Two-Index framework for separating epistemic and aleatoric sources of uncertainty, deriving MI-LB as a closed-form approximation.
result MI-LB consistently outperforms baselines on multimodal regression tasks.
A new method for efficient distributed optimization using trajectory-based normalized gradients.
problem Efficient communication in large-scale distributed optimization.
method A bijective mapping between gradient distributions, using normalized gradients and dynamically extracted references.
result Trajectory-based normalized gradients (TNG) improves communication efficiency in distributed optimization.
This paper explores VAEs in Fisher-Shannon plane, revealing the relationship between Fisher information and Shannon entropy.
problem Understanding the relationship between Fisher information and Shannon entropy in VAEs.
method Investigation of VAEs in Fisher-Shannon plane, focusing on the trade-off between Fisher information and Shannon entropy.
result VAEs' representation learning and log-likelihood estimation are intrinsically related to Fisher information and Shannon entropy.
New algorithm selects relevant variables in high-dimensional graphical models.
problem Automatic selection of relevant variables in high-dimensional graphical models.
method Extends Chow and Liu's algorithm using mutual information and entropy coefficient of determination.
result Outperforms existing methods in selecting variables with explanatory power.
Chatbot uses BERT to handle financial investment questions, improving accuracy and decision-making.
problem Improving accuracy and decision-making in financial investment customer service.
method Deep Bidirectional Transformer (BERT) model, uncertainty measure comparison, mixed-integer programming, automatic spelling correction.
result Chatbot can recognize 381 intents and decide when to escalate questions.
A new active learning method for Gaussian process models.
problem Efficiently exploring unbounded state spaces for accurate models.
method Maximizes mutual information with respect to a bounded region using model predictive control.
result Our method yields a better model within the region of interest than entropy-based methods.
Graph-based approach predicts stock trends using dynamic multi-relational graphs.
problem Predicting future stock movements in complex, time-evolving stock relationships.
method Dynamic multi-relational stock graphs, stochastic diffusion process, parallel retention.
result Outperforms state-of-the-art baselines in stock trend forecasting.
A new framework uses information theory to detect anomalies in images without labeled data.
problem Detect anomalies in images without labeled data.
method A direct objective function using information theory to maximize the distance between normal and anomalous data.
result The proposed framework significantly outperforms state-of-the-arts on multiple benchmark datasets.
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.
A new method for feature fusion in U-Net decoders using difference-based gating.
problem Precise fusion of high-level semantics and low-level details in U-Net decoder reconstruction.
method Proposes two difference-based gating approaches: Feature-difference gating (FDG) and Entropy-difference gating (EDG).
result Both FDG and EDG methods outperform existing attention-based fusion methods, with EDG showing superior performance.
A new kernel improves statistical surrogates for stochastic manifolds with diverse data.
problem Handling statistical surrogates for stochastic manifolds with heterogeneous data.
method A transient anisotropic kernel is introduced to improve statistical surrogates for stochastic manifolds with heterogeneous data.
result The transient anisotropic kernel provides a better representation of statistical dependencies in the learned probability measure.
Wavelet analysis reveals financialization effects on oil-food price correlation.
problem Investigating the correlation between oil and food prices and their determinants.
method Wavelet analysis and energy-based measures to differentiate high and low frequency movements.
result Significant local correlation between food and oil is due to financialization and emerging economies' demand.
The paper applies Gaussianization to analyze Earth data, simplifying complex multivariate distributions.
problem Challenges in accurately estimating information content in high-dimensional, heterogeneous Earth data.
method Multivariate Gaussianization for robust probability density estimation.
result Validates the method for estimating information-theoretic measures in Earth system data.
EDD uses entropy of distance distributions to cluster unlabeled data.
problem Challenges in clustering unlabeled high-dimensional data.
method EDD employs Shannon entropy to quantify distance distribution peaks.
result EDD detects varying degrees of clustering sensitivity.
AdOBEst-LDP improves privacy-preserving frequency estimation for categorical data.
problem Estimating categorical distributions online while preserving privacy.
method AdOBEst-LDP uses adaptive randomized response mechanism to enhance future data utility.
result AdOBEst-LDP selects optimal subset for LDP mechanism with high probability.
Generative models help analyze complex travel behavior data.
problem Analyzing large scale multiple discrete-continuous travel behavior data.
method Proposed a bi-partite generative model framework using restricted Boltzmann machines.
result The model accurately represents the joint distribution of MDC data and performs better than discriminative methods.
Optimizes data compression for binary classification tasks, finding the best tradeoff between entropy and class information.
problem Finding the best tradeoff between retained entropy and class information in binary classification tasks.
method Develops a method to map out the Pareto frontier for classification tasks, using a random variable to retain all information and then compressing it into a discrete variable.
result The method finds the optimal tradeoff between entropy and class information, providing a discrete variable that maximizes mutual information.