The paper focuses on the sparse approximation of signals using overcomplete representations, such that it preserves the (prior) structure of multi-dimensional signals. The underlying optimization problem is tackled using a multi-dimensional split Bregman optimization approach. An extensive empirical evaluation shows ho…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,181 papers · 148 categories
Trend · papers per month
48 results for “multi-dimensional signals”
New graph Fourier transform distinguishes directions in multi-dimensional signals.
problem Existing graph Fourier transform fails to distinguish directions in multi-dimensional signals.
method Algebraic properties of Cartesian products rearrange 1-D spectra into multi-dimensional frequency domain.
result Solves multi-valuedness of spectra and enables directional frequency analysis.
Beyond Polarity: Multi-Dimensional LLM Sentiment Signals for WTI Crude Oil Futures Return Predictionq-fin.ST
Improved crude oil price forecasting using multi-dimensional LLM sentiment signals.
problem Challenges in predicting crude oil prices due to unstructured news.
method Extracted five sentiment dimensions from GPT-4o, Llama 3.2-3b, and FinBERT models on energy-sector news articles.
result Combining GPT-4o and FinBERT yields the best predictive performance for weekly WTI crude oil futures returns.
PDE-Foam - a probability-density estimation method using self-adapting phase-space binningphysics.data-an
Probability Density Estimation (PDE) is a multivariate discrimination technique based on sampling signal and background densities defined by event samples from data or Monte-Carlo (MC) simulations in a multi-dimensional phase space. In this paper, we present a modification of the PDE method that uses a self-adapting bi…
Efficient biclustering of tensor data for identifying similar signal patterns over time.
problem Identifying similar signal patterns over time in multi-dimensional data.
method Spectral decomposition to build biclusters.
result Quality of biclusters evaluated using synthetic and real data.
Graph Signal Processing (GSP) is a promising framework to analyze multi-dimensional neuroimaging datasets, while taking into account both the spatial and functional dependencies between brain signals. In the present work, we apply dimensionality reduction techniques based on graph representations of the brain to decode…
Framework learns asymmetric and local features in multi-dimensional data.
problem Learning features in multi-dimensional data, especially images.
method Bayesian hierarchical modeling with recursive wavelet transforms.
result Framework achieves high computational scalability and adaptivity.
A method for predicting human locomotion using sensor correlations.
problem Predicting missing signals in human locomotion data.
method Coregionalised Locomotion Envelopes - multi-dimensional manifold regression.
result Developed a qualitative method for robust control of rehabilitation robots.
MDS benefits from symmetry, revealing key frequencies.
problem Understanding MDS in symmetrical data.
method Analyzed MDS on groups, focusing on symmetry properties.
result Only a few frequencies contribute to MDS output.
Unified model for market dynamics, linking price and order flow.
problem Modeling market dynamics and order flow in a unified framework.
method Markovian market model driven by a hidden Brownian efficient price, signal-driven and queue-reactive models.
result Stability of mid-price around efficient price at macroscopic scale, behavior as diffusion.
Backpropagation-free RL method trains layers using local signals.
problem Vanishing or exploding gradients in backpropagation-based RL.
method Local pairwise distance matching for layer-wise training without backpropagation.
result Backpropagation-free method achieves competitive performance and stability.
MCLNN improves sound recognition by learning frequency bands.
problem Efficiently recognizing acoustic events from audio signals.
method MCLNN uses a binary mask to force sparseness in network weights, focusing on frequency bands.
result MCLNN achieves competitive performance in sound recognition compared to state-of-the-art methods.
TEAFormers preserve multi-dimensional time series structures for better forecasting.
problem Traditional Transformers flatten multi-dimensional time series data, losing critical multi-dimensional relationships.
method Tensor-Augmented Transformer (TEAFormer) with Tensor-Augmentation (TEA) module.
result Significant performance enhancements in time series forecasting across benchmarks.
Proposes a deep neural network for multi-dimensional functional data classification.
problem Classifying multi-dimensional functional data with non-Gaussian distributions.
method Trains a deep neural network on the principle components of the training data.
result FDNN achieves minimax optimality when log density ratio has a locally connected modular structure.
A low-rank tensor model simplifies multi-dimensional Markov chains.
problem Simplifying the dynamics of multi-dimensional Markov chains.
method Low-rank tensor decomposition for multi-dimensional state spaces.
result Our tensor model requires fewer parameters and samples than conventional methods.
MCLNN improves music genre classification with automated feature exploration.
problem Music genre classification using neural networks.
method MCLNN uses a mask to enforce sparseness and learn time-frequency representations.
result MCLNN achieves competitive accuracy compared to state-of-the-art methods.
Study optimal stopping times for multi-dimensional processes with non-exponential discounting.
problem Optimal stopping in multi-dimensional processes with non-exponential discounting.
method Probabilistic potential theory to establish existence of optimal equilibria.
result Existence of optimal equilibria for multi-dimensional stopping problems.
New method for valid and exact statistical inference of multi-dimensional change-points.
problem Statistical inference of change-points in multi-dimensional sequences.
method Proposes a method to guarantee the statistical reliability of both location and components of detected changes.
result Demonstrates the effectiveness of the method in genomic abnormality identification and human behavior analysis.
Paper solves robust multi-dimensional scaling with accelerated projections.
problem Localize point locations from noisy pairwise distances.
method Alternating projections with tangent space acceleration.
result Linear convergence of reconstructed points to original points.
New method uses models from regularity structures as features in machine learning.
problem Learning solutions to PDEs with low regularity.
method Developed a flexible definition of model feature vectors and two algorithms for combining them with linear regression.
result Advantage in learning solutions to PDEs compared to alternative methods.
This paper reviews multiple try MCMC methods for signal processing.
problem Estimating parameters in signal processing using Bayesian inference.
method Review of MCMC methods with multiple candidates.
result Comparison and analysis of different MCMC techniques.
This paper tackles efficient cooperative control for large-scale traffic signals using tensor-based deep learning.
problem Efficient training and control for large-scale multi-intersection traffic signals.
method Tensor representation, multi-task learning, imitation learning, proximal policy optimization.
result The proposed model achieves better performance compared to existing methods.
Paper defines multi-dimensional fractional Brownian motion under volatility uncertainty.
problem Volatility uncertainty in fractional Brownian motion.
method Definition and study of multi-dimensional fractional Brownian motion (G-fBm) with Hurst index.
result First results on stochastic calculus for G-fBm with Hurst index > 0.5.
PFE embeds images into sparse regions for better segmentation.
problem Image segmentation challenges with slowly varying signals and sparse region boundaries.
method Piecewise Flat Embedding (PFE) using sparse signal recovery theory, L1,p regularization, and Bregman iterations.
result PFE enhances image segmentation performance on multiple datasets.
Paper formalizes multi-dimensional FSD using geometric methods.
problem Complex measure theory and calculus barriers to formalization in proof assistants.
method Geometric framework for first-order stochastic dominance in N dimensions.
result Geometric approach bypasses complex integration theory for direct comparison of survival probabilities.
Robust deep neural networks estimate multi-dimensional functional data robustly.
problem Estimating location function from multi-dimensional functional data robustly.
method Deep neural networks with ReLU activation, robust to outliers and model misspecification.
result Uniform convergence rates for robust deep neural network estimators.
Generative model combines multi-dimensional annotations for more accurate ground truth estimation.
problem Inaccurate ground truth estimation from naive annotators' multi-dimensional annotations.
method Proposes a joint multi-dimensional model for global and time-series annotation fusion using Expectation-Maximization algorithm.
result More accurate ground truth estimates through joint modeling of multiple dimensions.
We propose a new framework for the analysis of low-rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank SVD for matrices and multi-linear SVD for tensors. Then, building …
A new method estimates multi-dimensional value distributions using Hilbert space embeddings.
problem Estimating value distributions in complex, multi-dimensional reinforcement learning settings.
method Hilbert space mappings and kernel mean embeddings to estimate the kernel mean embedding of multi-dimensional value distributions.
result Uniform convergence guarantees and robust off-policy evaluation demonstrated in simulations.
New method for handling multi-dimensional singular controls with jump costs in mean-field problems.
problem Handling jump costs in multi-dimensional singular controls.
method Introducing two-layer parametrisations to interpolate jumps on both distributional and pathwise levels.
result Derivation of a DPP and characterisation of the value function as a minimal super-solution to a quasi-variational inequality.
Two spherical and flat periscopes are analyzed in multi-dimensional space.
problem Understanding the wave fronts of periscopes in various dimensions.
method Local diffeomorphisms of wave fronts induced by 2-mirror systems are described.
result Local diffeomorphisms of wave fronts are characterized for spherical and flat periscopes.
Algorithm estimates common mean from Gaussian variables with unknown variances.
problem Estimating common mean from Gaussian variables with different unknown variances.
method Intuitive and efficient algorithm using Subset-of-Signals model as benchmark.
result Improved estimation error by polynomial factors compared to previous work.
Paper solves multi-dimensional passport option pricing problem using machine learning.
problem Pricing multi-dimensional passport options in correlated markets remains unsolved.
method Discrete-time solution for multi-dimensional BS markets with uncorrelated assets; machine learning approaches.
result Machine learning-powered approaches successfully price passport options in both 1D and multi-dimensional uncorrelated BS markets.
Non-Gaussian component analysis (NGCA) is an unsupervised linear dimension reduction method that extracts low-dimensional non-Gaussian "signals" from high-dimensional data contaminated with Gaussian noise. NGCA can be regarded as a generalization of projection pursuit (PP) and independent component analysis (ICA) to mu…
Principal binets generalize curvature line surfaces to square lattices and are a discrete integrable system.
problem Discretizing curvature line surfaces on square lattices.
method Showed principal binets as a multi-dimensional consistent system.
result Principal binets generalize to higher-dimensional square lattices and are integrable.
A new tensor-based method improves multi-dimensional data classification accuracy.
problem Efficient representation and classification of multi-dimensional data from multiple sensors.
method n-mode generalized difference subspace (n-mode GDS) for tensor data, with improved metric based on geodesic distance.
result The proposed method outperforms existing methods in gesture and action recognition.
The abstract introduces a new concept called flagfolds to model multi-dimensional shapes.
problem Modeling multi-dimensional shapes in a way that avoids going through higher dimensional spaces.
method Interpreting covariance matrices as nested subspaces and defining a Riemannian metric on the highest dimensional stratum.
result A Riemannian metric on the highest dimensional stratum allows for geodesics between subspaces of different dimensions.
Deep learning detects arrhythmias from ECGs using multidimensional representations.
problem Detecting arrhythmias from ECGs using traditional methods.
method Convert 1-D ECG data into 2-D images, then use deep learning for classification.
result Deep learning outperforms existing methods in arrhythmia detection.
A Method of Reducing Dimension of Space Variables in Multi-dimensional Black-Scholes Equationsq-fin.CP
We study a method of reducing space dimension in multi-dimensional Black-Scholes partial differential equations as well as in multi-dimensional parabolic equations. We prove that a multiplicative transformation of space variables in the Black-Scholes partial differential equation reserves the form of Black-Scholes part…
Functional Magnetic Resonance Imaging (fMRI) is a powerful non-invasive tool for localizing and analyzing brain activity. This study focuses on one very important aspect of the functional properties of human brain, specifically the estimation of the level of parallelism when performing complex cognitive tasks. Using fM…
Random Tessellation Forestsstat.ML
Random Tessellation Process improves multi-dimensional data analysis.
problem Axis-aligned cuts limit flexibility in space partitioning methods.
method Proposes Random Tessellation Process (RTP) for non-axis aligned cuts.
result Improved accuracies in gene expression data analysis.
We derive deterministic criteria for the existence and non-existence of equivalent (local) martingale measures for financial markets driven by multi-dimensional time-inhomogeneous diffusions. Our conditions can be used to construct financial markets in which the \emph{no unbounded profit with bounded risk} condition ho…
Paper proves stability of multi-dimensional rarefaction waves in gas dynamics.
problem Challenges in constructing multi-dimensional rarefaction waves in gas dynamics.
method Geometric Weighted Energy Method (GWEM) to overcome derivative losses.
result Established nonlinear stability of multi-dimensional rarefaction waves for compressible Euler equations.
HI-SIGMA improves sensitivity in high-dimensional statistical inference with data-driven background models.
problem Performing high-dimensional statistical inference with complex backgrounds in high-energy physics.
method HI-SIGMA uses generative ML models to learn signal and background distributions, incorporating systematic uncertainties.
result HI-SIGMA provides improved sensitivity compared to classifier-based methods.
This work identifies eigenvalues of unknown linear dynamics without full system identification.
problem Identifying parameters of a linear dynamical system is challenging.
method Developed a computationally efficient algorithm to estimate eigenvalues of the state-transition matrix.
result The algorithm can efficiently cluster multi-dimensional time series with temporal offsets and varying lengths.
Contrast uses normalizing flows to create precise prediction regions for multi-dimensional outputs.
problem Generating reliable prediction regions for multi-dimensional outputs in supervised and unsupervised learning.
method Contrast uses normalizing flows to define nonconformity scores based on distances in latent space, creating sharp prediction regions.
result Contrast maintains guaranteed coverage probability and outperforms existing methods in generating accurate prediction regions.
MTL improves multi-dimensional regression in luminescence sensing.
problem Challenges in modeling multi-dimensional regression problems with classical methods.
method Multi-task learning (MTL) with feed-forward neural networks (FFNNs).
result MTL allows predicting multiple parameters from a single set of measurements.
A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.
problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.