FreDN separates trends and periodicities in non-stationary time series forecasts.
problem Spectral entanglement and computational burden in frequency-domain methods for non-stationary time series.
method FreDN introduces a learnable Frequency Disentangler module to separate trend and periodic components directly in the frequency domain, and uses a ReIm Block to reduce complexity.
result FreDN outperforms state-of-the-art methods by up to 10% on long-term forecasting benchmarks.
New framework learns disentangled causal representations from observed labels.
problem Learning meaningful disentangled causal representations from observed data.
method ICM-VAE framework using flow-based diffeomorphic functions and causal disentanglement prior.
result Induces highly disentangled causal factors and improves robustness.
A framework for disentangling class-related and class-independent factors in data.
problem Learning disentangled representations in variational autoencoders.
method Attention mechanism in latent space, mixture models, Bhattacharyya coefficient, semi-supervised training.
result Disentangles class-related and class-independent factors of variation.
New CFNN architecture approximates functions with machine accuracy.
problem Function approximation with high precision.
method Chebyshev Feature Neural Network (CFNN) with learnable frequencies.
result Achieves machine accuracy in function approximation.
New principle reveals how neural networks learn complex interactions.
problem Understanding neural networks' success and complexity.
method Infinite-width networks, focusing on frequency and space.
result Fine-grained eigenstructure improves network learnability.
A deep learning framework learns wavelet packet transforms for efficient feature extraction.
problem Efficiently extracting meaningful time-frequency features from high-frequency signals.
method Learnable wavelet packet transforms using deep learning.
result Improved spectral leakage and enhanced anomaly detection performance.
VDA improves disentanglement of latent representations in complex signals.
problem Learning disentangled and interpretable representations in nonstationary, high-dimensional time-evolving signals.
method Variational decomposition autoencoding (VDA) framework, incorporating signal decomposition, contrastive self-supervised task, and variational prior approximation.
result DecVAEs surpass state-of-the-art VAE-based methods in disentanglement quality and generalization.
WaveLSFormer learns profitable trading policies from financial time series data.
problem Challenges in learning profitable intraday trading policies from financial time series data.
method WaveLSFormer uses a learnable wavelet-based long-short Transformer to jointly perform multi-scale decomposition and return-oriented decision learning.
result WaveLSFormer consistently outperforms MLP, LSTM, and Transformer backbones in trading performance.
Quantizes latent space to improve disentanglement in models.
problem Learning disentangled representations from unlabeled data.
method Quantizes latent space into discrete code vectors with a learnable scalar codebook and applies high weight decay regularization.
result Quantized-latent autoencoder (QLAE) outperforms prior work in disentanglement without sacrificing data reconstruction.
Using recent advances in the econometrics literature, we disentangle from high frequency observations on the transaction prices of a large sample of NYSE stocks a fundamental component and a microstructure noise component. We then relate these statistical measurements of market microstructure noise to observable charac…
It has been postulated that a good representation is one that disentangles the underlying explanatory factors of variation. However, it remains an open question what kind of training framework could potentially achieve that. Whereas most previous work focuses on the static setting (e.g., with images), we postulate that…
We present a method for audio denoising that combines processing done in both the time domain and the time-frequency domain. Given a noisy audio clip, the method trains a deep neural network to fit this signal. Since the fitting is only partly successful and is able to better capture the underlying clean signal than th…
It has been postulated that a good representation is one that disentangles the underlying explanatory factors of variation. However, it remains an open question what kind of training framework could potentially achieve that. Whereas most previous work focuses on the static setting (e.g., with images), we postulate that…
T-KAN improves HFT LOB forecasting with learnable splines.
problem Alpha decay in HFT LOB forecasting models.
method T-KAN uses learnable B-spline activation functions to model market signals.
result 19.1% relative improvement in F1-score at k = 100 horizon.
Humans perceive the seemingly chaotic world in a structured and compositional way with the prerequisite of being able to segregate conceptual entities from the complex visual scenes. The mechanism of grouping basic visual elements of scenes into conceptual entities is termed as perceptual grouping. In this work, we pro…
FredNormer improves time series forecasting by adapting to frequency domain patterns.
problem Current normalization methods struggle with non-stationary time series due to their time-domain approach.
method FredNormer analyzes frequency components, adapts weights, and improves robustness.
result FredNormer boosts forecasting accuracy by 33.3% on ETTm2 dataset.
A new KAN variant uses sinusoidal activations to approximate functions.
problem Approximating multivariable functions using neural networks.
method Replacing inner and outer functions in Kolmogorov-Arnold representation with weighted sinusoidal functions.
result The new KAN variant outperforms fixed-frequency Fourier transform and achieves comparable performance to MLPs.
This paper proposes an enhanced approach to modeling and forecasting volatility using high frequency data. Using a forecasting model based on Realized GARCH with multiple time-frequency decomposed realized volatility measures, we study the influence of different timescales on volatility forecasts. The decomposition of …
Over-parameterized deep neural networks have proven to be able to learn an arbitrary dataset with 100% training accuracy. Because of a risk of overfitting and computational cost issues, we cannot afford to increase the number of network nodes if we want achieve better training results for medical images. Previous de…
Recent advances in deep learning motivate the use of deep neural networks in Internet-of-Things (IoT) applications. These networks are modelled after signal processing in the human brain, thereby leading to significant advantages at perceptual tasks such as vision and speech recognition. IoT applications, however, ofte…
NFM models time-series data directly in the Fourier domain, achieving state-of-the-art performance.
problem Traditional time-series analysis focuses on the time domain, limiting flexibility.
method NFM models time-series data in the Fourier domain, using frequency extrapolation and interpolation.
result NFM achieves state-of-the-art performance on various time-series tasks.
Thanks to the access to labeled orders on the Cac40 index future provided by Euronext, we are able to quantify market participants contributions to the volatility in the diffusive limit. To achieve this result we leverage the branching properties of Hawkes point processes. We find that fast intermediaries (e.g., market…
Study shows realizable learnability doesn't imply agnostic learnability for distributions.
problem Learnability and robustness of distribution classes.
method Analyzes the relationship between learnability and robustness for distribution learning.
result Realizable learnability does not imply agnostic learnability for distributions.
Study extends learnability equivalence to multi-class and regression, overcoming binary classification limits.
problem Equivalence of online and private learnability in multi-class and regression settings.
method Introduced a novel Littlestone dimension variant and threshold functions for multi-class classification.
result Online learnability implies private learnability in multi-class classification but not in regression.
New method bypasses global fit for LISA's Galactic binaries, extracting population parameters directly.
problem Disentangling LISA's Galactic binary sources from backgrounds in a computationally intensive process.
method Simulation-based approach using normalizing flow to infer population parameters.
result Direct inference of population parameters from LISA's frequency strain series.
We study the role of co-jumps in the interest rate futures markets. To disentangle continuous part of quadratic covariation from co-jumps, we localize the co-jumps precisely through wavelet coefficients and identify statistically significant ones. Using high frequency data about U.S. and European yield curves we quanti…
Example shows learnable distributions not privately learnable.
problem Learnable distributions under non-private conditions not transferable to differential privacy.
method Example of a distribution class learnable up to constant error in total variation distance but not under differential privacy.
result Contradicts conjecture of Ashtiani on learnability under differential privacy.
We propose the factorized action variational autoencoder (FAVAE), a state-of-the-art generative model for learning disentangled and interpretable representations from sequential data via the information bottleneck without supervision. The purpose of disentangled representation learning is to obtain interpretable and tr…
To evaluate disentangled representations several metrics have been proposed. However, theoretical guarantees for conventional metrics of disentanglement are missing. Moreover, conventional metrics do not have a consistent correlation with the outcomes of qualitative studies. In this paper we analyze metrics of disentan…
New technique learns causally disentangled representations for better generation.
problem Learning disentangled representations for accurate generation.
method Causally Disentangled Generation (CDG) approach with supervised regularization.
result CDG is necessary and sufficient for accurate disentangled generation.
Study laws of large numbers in online classification, determining optimal regret bounds.
problem Understanding how sequential sampling affects online learning and classification.
method Characterized online learnable classes and determined optimal regret bounds using Littlestone's dimension.
result Optimal regret bounds in online learning are determined, resolving open questions.
Disentangled representations, where the higher level data generative factors are reflected in disjoint latent dimensions, offer several benefits such as ease of deriving invariant representations, transferability to other tasks, interpretability, etc. We consider the problem of unsupervised learning of disentangled rep…
We analyze disentangled representations under a causal generative process, proposing new metrics and datasets.
problem Addressing fairness and interpretability through disentangled representations with a causal perspective.
method Work under a causal generative process, proposing new metrics and datasets to study disentanglement.
result Proposed metrics capture the desiderata of disentangled causal process.
Characterizes learnability of multioutput functions in various settings.
problem Learning multioutput function classes in batch and online settings.
method Characterizes learnability based on single-output restrictions.
result Complete characterization of learnability in multioutput classification and regression.
New framework for disentangling graph node and edge features.
problem Learning disentangled representations for attributed graphs with node and edge features.
method Proposes a novel variational objective and architecture for node and edge deconvolutions to disentangle latent factors.
result Demonstrates effectiveness of the proposed model and its extensions on synthetic and real-world datasets.
Proposes a new method for disentangling data representations using topological analysis.
problem Learning disentangled representations for better model explainability and robustness.
method Integrates a multi-scale topological loss term into the training of deep learning models.
result Improves disentanglement scores compared to state-of-the-art methods.
A new method for disentangling action sequences improves model stability.
problem Challenges in unsupervised disentanglement learning due to incomplete theories and abstract notions.
method Introducing disentangling action sequences and a novel fractional variational autoencoder (FVAE) framework.
result FVAE improves the stability of disentanglement for action sequences.
GCAE uses density estimation to achieve reliable disentanglement in latent space.
problem Disentangled learning representations suffer from reliability issues.
method GCAE uses Gaussian Channel Autoencoder with Dual Total Correlation (DTC) to avoid the curse of dimensionality.
result GCAE achieves highly competitive and reliable disentanglement scores.
The paper connects disentanglement to manifold charts and commutativity.
problem Discovering local charts of the data manifold for disentanglement.
method Interpreting disentanglement as local charts of the data manifold and studying commutativity.
result Commutativity is a central property in disentanglement, as shown in manifold, group theoretic, and probabilistic frameworks.
The profile of a sample is the multiset of its symbol frequencies. We show that for samples of discrete distributions, profile entropy is a fundamental measure unifying the concepts of estimation, inference, and compression. Specifically, profile entropy a) determines the speed of estimating the distribution relative t…
Research characterizes learnability of multilabel ranking problems.
problem Learnability of multilabel ranking problems with relevance-score feedback.
method Characterizes learnability in batch and online settings for a large family of ranking losses.
result Characterizes two equivalence classes of ranking losses based on learnability.
Improved VAE learns disentangled representations with less supervision.
problem Learning disentangled representations is challenging.
method Semi-supervised disentanglement learning with label replacement.
result Significant improvement in disentanglement with minimal supervision.
New metric for disentangling multivariate representations, accounting for more complex entanglements.
problem Current disentanglement metrics fail to detect entanglements involving more than two variables.
method Partial Information Decomposition framework to analyze information sharing and propose a new disentanglement metric.
result The proposed metric correctly identifies entanglements in high-dimensional spaces.
This report to our stage 1 submission to the NeurIPS 2019 disentanglement challenge presents a simple image preprocessing method for training VAEs leading to improved disentanglement compared to directly using the images. In particular, we propose to use regionally aggregated feature maps extracted from CNNs pretrained…
Improved disentanglement of data factors using recursive training.
problem Current unsupervised disentanglement methods are inconsistent and fail to achieve levels of disentanglement seen in supervised approaches.
method Introduced PBT for VAEs, used UDR for heuristic scoring, and developed recursive rPU-VAE approach.
result Recursive training leads to robust disentanglement of data factors across multiple datasets.
We define and address the problem of unsupervised learning of disentangled representations on data generated from independent factors of variation. We propose FactorVAE, a method that disentangles by encouraging the distribution of representations to be factorial and hence independent across the dimensions. We show tha…
New method learns disentangled discrete representations using categorical variational autoencoders.
problem Learning disentangled representations from discrete latent spaces.
method Replaced standard Gaussian VAE with a categorical VAE to mitigate rotational invariance.
result Categorical distributions improve learning of disentangled representations.
Disentangled representations have recently been shown to improve fairness, data efficiency and generalisation in simple supervised and reinforcement learning tasks. To extend the benefits of disentangled representations to more complex domains and practical applications, it is important to enable hyperparameter tuning …