Kendall transformation converts continuous data into categorical vectors for robust information theory.
problem Handling small number of observations and preserving ranking in continuous data.
method Kendall transformation converts ordered features into categorical vectors of pairwise order relations.
result Kendall transformation makes information theory methods applicable to continuous data robustly.
Data transformation, e.g. feature transformation and selection, is an integral part of any machine learning procedure. In this paper we introduce an information-theoretic model and tools to assess the quality of data transformations in machine learning tasks. In an unsupervised fashion, we analyze the transfer of infor…
Pre-training on different modalities improves Transformer performance in offline reinforcement learning.
problem Improving Transformer-based models for offline reinforcement learning tasks.
method Empirical investigation of pre-training on language and vision data, analysis of internal representations, and fine-tuning with no context.
result Pre-trained Transformers with language data can utilize context-like information to solve reinforcement learning tasks efficiently.
Symmetry transformations induce invariances which are frequently described with deep latent variable models. In many complex domains, such as the chemical space, invariances can be observed, yet the corresponding symmetry transformation cannot be formulated analytically. We propose to learn the symmetry transformation …
Study excess risk in statistical inference with transformations.
problem Excess risk in estimating random variables from feature vectors and transformations.
method Characterize lossless transformations, develop test statistics, and information-theoretic bounds.
result Strongly consistent partitioning test statistic for lossless transformations.
Graph transformers outperform graph convolutions by preserving community information.
problem Understanding why graph transformers perform well in node-level prediction tasks.
method Analyzing the Gaussian process limits of graph transformers with infinite width and infinite heads.
result Graph transformers maintain discriminative node representations even in deep layers, preventing oversmoothing.
Minimal token perturbations reveal how Transformer models process information.
problem Understanding information propagation in Transformer models for interpretability.
method Study of minimal token perturbations on embedding space.
result Rare tokens cause larger shifts, and input information mixes deeper.
Transformation Equivariant Representations (TERs) aim to capture the intrinsic visual structures that equivary to various transformations by expanding the notion of {\em translation} equivariance underlying the success of Convolutional Neural Networks (CNNs). For this purpose, we present both deterministic AutoEncoding…
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.
Paper develops a new model for predicting volatility surface.
problem Predicting volatility in financial markets is challenging due to its non-observable nature and complex dynamics.
method Physics-informed convolutional transformer architecture.
result The new model outperforms other deep-learning architectures in predicting volatility surface.
Objective: A variety of pattern analysis techniques for model training in brain interfaces exploit neural feature dimensionality reduction based on feature ranking and selection heuristics. In the light of broad evidence demonstrating the potential sub-optimality of ranking based feature selection by any criterion, we …
A new method detects financial fraud using graph transformers.
problem Detecting fraudulent transactions in financial data.
method Spatial-Temporal-Aware Graph Transformer (STA-GT) integrating GNNs and transformers.
result STA-GT outperforms general GNN models on financial fraud detection.
Transformers learn to integrate information from past positions incrementally, specializing heads in distinct patterns.
problem How transformers learn to integrate information from multiple past positions with varying statistical significance.
method High-order Markov chain task, incremental learning, sparse attention patterns, simplified differential equations, stage-wise convergence, early stopping as regularizer.
result Transformers learn to specialize heads in distinct patterns, shifting from competitive to cooperative learning dynamics.
Transformer model improves asset allocation by unifying forecasting and optimization.
problem Separation of forecasting and optimization leads to suboptimal portfolios.
method Signature Informed Transformer using path signatures and specialized attention.
result Direct minimization of Conditional Value at Risk improves performance.
Transformer architecture improved with credibility mechanism for better model performance.
problem Improving predictive models in tabular data.
method Introducing a credibility mechanism to the Transformer architecture.
result Credibility Transformer leads to superior predictive models compared to state-of-the-art models.
In many real-world systems, information can be transmitted in two qualitatively different ways: by copying or by transformation. Copying occurs when messages are transmitted without modification, e.g., when an offspring receives an unaltered copy of a gene from its parent. Transformation occurs when messages are modifi…
Concrete distribution properties examined on simplex.
problem Properties of Concrete distribution on simplex.
method Reflection and location-scale transformation of uniform distribution; explicit parameterization to Poincaré half-space.
result Fisher information and information metric are hyperbolic space; Fisher-Rao geodesic distance computed.
PatchGT uses non-trainable graph patches to improve graph representation learning.
problem Learning high-level information in graph tasks with direct Transformer models.
method PatchGT segments graphs into non-trainable patches, uses GNN for patch-level learning, and Transformer for graph-level learning.
result PatchGT achieves higher expressiveness and competitive performance on benchmark datasets.
This work integrates differentiation and integration in Physics-Informed Neural Networks.
problem Solving integro-differential equations and computing integral transforms.
method Augmenting Physics-Informed Neural Networks with automatic integration.
result Solving complex integral transforms and integro-differential equations.
We tackle the task of environmental event classification by drawing inspiration from the transformer neural network architecture used in machine translation. We modify this attention-based feedforward structure in such a way that allows the resulting model to use audio as well as video to compute sound event prediction…
Top-down information plays a central role in human perception, but plays relatively little role in many current state-of-the-art deep networks, such as Convolutional Neural Networks (CNNs). This work seeks to explore a path by which top-down information can have a direct impact within current deep networks. We explore …
Paper presents a model for identifying informative COVID-19 tweets.
problem Identifying informative COVID-19 tweets on Twitter.
method Leveraged transformers (RoBERTa, XLNet, BERTweet) trained in Semi-Supervised Learning (SSL) setting.
result Achieved F1 score of 0.9011 on test set, ranking 7th on leaderboard.
Deep latent variable models are powerful tools for representation learning. In this paper, we adopt the deep information bottleneck model, identify its shortcomings and propose a model that circumvents them. To this end, we apply a copula transformation which, by restoring the invariance properties of the information b…
The paper analyzes how market prices respond to information processing and non-linear dynamics.
problem Understanding how market prices change in response to information.
method Logistic Continuous Wavelet Transformation method applied to SP 500 market data.
result Identifies patterns in market dynamics and describes them using a new theory of reflexive communication.
Sparse Transformers degrade semantic information first, with early layers encoding more.
problem Understanding how sparse Transformers affect learned representations and semantic information.
method Probed Transformers with progressively pruned weights to observe changes in semantic information and model behavior.
result Complex semantic information is first to degrade in sparse Transformers, with early layers encoding more.
A new hierarchy quantifies agency in systems based on information processing.
problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.
A method for vectorizing persistence diagrams simplifies topological data analysis.
problem Challenges in integrating persistence diagrams into machine learning pipelines.
method Quantized Persistence and Integral transforms of Diagrams (Qupid) using binning and discrete transforms.
result Qupid preserves highly competitive performances compared to state-of-the-art methods across various classification tasks.
Centroid Transformers reduce memory and computation by summarizing inputs into centroids.
problem Efficiently summarize inputs with reduced memory and computation.
method Generalizes self-attention to map N inputs to M centroids (M ≤ N), reducing complexity.
result Centroid Transformers reduce memory and computation while preserving key information.
Transformers learn causal structure through gradient descent on self-attention mechanisms.
problem Understanding how transformers learn causal structure during training.
method In-context learning task and simplified two-layer transformer model.
result Gradient descent on a simplified transformer learns to encode latent causal graphs.
Kriformer uses graph transformers to estimate data in sparse sensor areas.
problem Sparse sensor deployment and unreliable data in spatiotemporal kriging tasks.
method Graph transformer model with positional encoding and attention mechanisms.
result Kriformer excels in representing unobserved locations in spatiotemporal kriging tasks.
Computation of moments of transformed random variables is a problem appearing in many engineering applications. The current methods for moment transformation are mostly based on the classical quadrature rules which cannot account for the approximation errors. Our aim is to design a method for moment transformation for …
Informer improves option pricing accuracy in volatile markets.
problem Challenges in accurate option pricing due to market volatility and traditional model limitations.
method Applying Informer, a Transformer-based neural network, for option pricing.
result Informer outperforms traditional models in option pricing accuracy.
Introduces a new geometric framework for probability distributions.
problem Developing a geometric framework for probability distributions.
method Introduces ℓp-information geometry and defines the ℓ2-probability simplex via the q-root transform. result Defines a noncanonical differentiable structure and q-root map as an isometry. Transformer learns CoVaR from financial news, improving systemic risk forecasts.
problem Quantifying systemic financial risk using conditional Value-at-Risk (CoVaR).
method Transformer-based approach integrating financial news articles with market data.
result Transformer CoVaR improves out-of-sample forecasts and identifies market stress periods.
Recurrent neural networks (RNNs) have been drawing much attention with great success in many applications like speech recognition and neural machine translation. Long short-term memory (LSTM) is one of the most popular RNN units in deep learning applications. LSTM transforms the input and the previous hidden states to …
The inference of deep hierarchical models is problematic due to strong dependencies between the hierarchies. We investigate a specific transformation of the model parameters based on the multivariate distributional transform. This transformation is a special form of the reparametrization trick, flattens the hierarchy a…
New formula extracts full local information from ray transform data.
problem Determining symmetric tensor fields from ray transform data.
method Deriving explicit formula for Saint Venant operator.
result Explicit formula for extracting full local information.
A novel text-independent speaker identification (SI) method is proposed. This method uses the Mel-frequency Cepstral coefficients (MFCCs) and the dynamic information among adjacent frames as feature sets to capture speaker's characteristics. In order to utilize dynamic information, we design super-MFCCs features by cas…
Transformers learn functionals from distributions without losing information.
problem Lack of rigorous mathematical theory supporting Transformer performance.
method Proposed a Transformer learning framework, attention operator, and distribution regression.
result Transformers can compress distributions into function representations without loss of information.
New STKR estimators use unlabeled data for smoother function learning.
problem Leveraging unlabeled data for smoother function learning.
method Spectrally transformed kernel regression (STKR) with scalable implementations.
result STKR can learn any sufficiently smooth function.
GATES improves neural architecture search by modeling operations as information transformation.
problem Improving predictor-based neural architecture search efficiency.
method GATES models operations as information transformation, covering both node and edge cell search spaces.
result GATES boosts sample efficiency and improves predictor performance.
Introduces new geometric framework for probability densities on manifolds.
problem Developing a new geometric framework for probability densities on manifolds.
method Introduces ℓp-information geometry and defines ℓ2-probability simplex with q-root transform. result Explicit solution of gradient flow and geodesic completeness of e-connection. New concept of epiplexity quantifies useful information from data.
problem Understanding useful information content from data without unlimited computational capacity.
method Introducing epiplexity, a measure of information computationally bounded observers can learn.
result Epiplexity captures useful information content, not just randomness.
Paper proposes a novel stock forecasting method combining attention and EMD.
problem Challenges in forecasting stock movement due to noise and lack of stock market information.
method Uses attention mechanism to consider both stock market and individual stock information, and EMD for noise reduction.
result Proposed method significantly outperforms state-of-the-art baselines.
This paper compares LSTM, GRU, and Transformer models for stock price prediction.
problem Improving stock price prediction accuracy in fast-paced financial markets.
method Training models on Tesla stock data from 2015 to 2024, comparing LSTM, GRU, and Transformer.
result LSTM model achieved 94% accuracy in predicting stock prices.
Compact Recurrent Transformer (CRT) improves Transformer efficiency for long sequences.
problem Efficiently scaling Transformer architecture to long sequences with limited compute resources.
method Combines shallow Transformer models with recurrent neural networks and persistent memory.
result CRT achieves comparable or superior performance to full-length Transformers with shorter segments and reduced FLOPs.
CAM-GAN improves GANs for continual learning with efficient feature map transformations.
problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.
Most companies utilize demographic information to develop their strategy in a market. However, such information is not available to most retail companies. Several studies have been conducted to predict the demographic attributes of users from their transaction histories, but they have some limitations. First, they focu…