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 features”
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.
New framework exploits edge features in graph neural networks for improved performance.
problem Insufficient utilization of edge features in current graph neural networks.
method Proposes a new framework with doubly stochastic normalization and multi-dimensional edge feature handling.
result Improves performance on graph node classification and regression tasks.
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 new sampling method improves word representation by considering multi-dimensional features.
problem Improving word representation in skip-gram models with negative sampling.
method Proposes a new sampling algorithm that dynamically selects informative negative samples based on inner product scores and multi-dimensional self-embedded features.
result The new sampling method outperforms existing ones without increasing computational complexity.
NEWMA detects changes in multi-dimensional data streams efficiently.
problem Detecting abrupt changes in multi-dimensional time series with limited resources.
method A simple, model-free online change-point detection method using two EWMA statistics with different forgetting factors and Random Features.
result The method is significantly faster than usual non-parametric methods for a given accuracy.
The paper investigates learning conditional distributions on multi-dimensional spaces using clustering and neural networks.
problem Learning conditional distributions on multi-dimensional spaces with varying dimensions.
method The approach involves clustering data near varying query points in the feature space to create empirical measures in the target space using two clustering schemes: fixed-radius ball and nearest neighbors. The convergence rates of both methods are analyzed, and the nearest neighbors method is incorporated into neural network training.
result The empirical analysis shows that the nearest neighbors method has better performance in practice and can adapt to a suitable level of Lipschitz continuity locally.
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.
Neural networks improve efficiency in integrating multi-dimensional phase spaces in particle physics.
problem Efficiently integrating multi-dimensional phase spaces in particle physics.
method Optimized Neural Network (NN) algorithm for phase space integration.
result NN-based approach achieves unweighting efficiencies of 30-75% in various particle physics examples.
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.
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.
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.
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.
Paper proposes FMore to incentivize edge nodes in federated learning with MEC.
problem Incentivizing edge nodes in federated learning with MEC resources.
method Multi-dimensional procurement auction with K winners.
result FMore improves model accuracy and reduces training rounds for AI tasks.
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.
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.
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.
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.
Explains Fisher and Kernel Fisher Discriminant Analysis with examples and comparisons.
problem Classifying data with different features and dimensions.
method Projection and reconstruction, scatters analysis, PCA comparison, Fisher forest.
result Equivalence of Fisher and Linear Discriminant Analysis, effectiveness of Fisher forest.
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.
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.
New graph CNN layers improve accuracy on graph datasets.
problem Graph data relations are better represented as graphs, not grids.
method Proposed new graph CNN layers for vertex and edge features.
result Improved classification accuracy on graph datasets.
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.
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…
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.
New method for approximating periodic kernels on high-dimensional data.
problem Inefficient modelling of periodicity in higher-dimensional problems.
method Index Set Fourier Series Features
result Significantly less predictive error compared to alternative methods.
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.
Method sanitizes IFM in CNN layers to control privacy loss.
problem Controlling privacy loss in CNNs using input feature maps.
method Sample-and-hold approximation scheme to sanitize IFM, unfolding tensors for independence from CNN configuration.
result Control the privacy loss by adjusting the sanitization degree.
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 method reduces dimensionality for multi-block data, enhancing feature extraction and classification accuracy.
problem Tractable feature extraction from large-scale, multi-dimensional data.
method Common and individual feature extraction from multi-block data structures using tensor decompositions.
result Significant reduction in dimensionality and enhanced accuracy in feature extraction and classification.
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.
We propose a novel kernel based post selection inference (PSI) algorithm, which can not only handle non-linearity in data but also structured output such as multi-dimensional and multi-label outputs. Specifically, we develop a PSI algorithm for independence measures, and propose the Hilbert-Schmidt Independence Criteri…
This paper proposes a multi-head attention model for predicting RUL in IIoT environments.
problem Estimating RUL for complex industrial equipment using IIoT data.
method Multi-Head Attention Mechanism combined with LSTM for multi-dimensional time-series data.
result The proposed model outperforms state-of-the-art models on benchmark datasets.
We consider a zero-sum stochastic differential controller-and-stopper game in which the state process is a controlled diffusion evolving in a multi-dimensional Euclidean space. In this game, the controller affects both the drift and the volatility terms of the state process. Under appropriate conditions, we show that t…
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.
A novel feature representation method for non-image based features.
problem Inability of Convolutional Neural Networks for non-image based features or features without spatial correlations.
method REFINED: Representation of Features as Images with Neighborhood Dependencies.
result Higher prediction accuracy compared to existing methodologies.
NeuralFDR learns optimal discovery thresholds from hypothesis features.
problem Maximizing useful discoveries while controlling false positives in rich datasets.
method Proposes NeuralFDR, a neural network that learns a discovery threshold as a function of hypothesis features.
result Demonstrates substantially more discoveries and interpretable learned thresholds in synthetic and real datasets.
Reformulates RBF networks for graph-based data.
problem Applying RBF networks to graph data.
method Reformulate RBF networks for adjacency matrices, derive gradient updates.
result Guaranteed same responses as vector-based RBF networks.
Bayesian model tackles intersectional fairness in AI.
problem Statistical challenges in measuring fairness for multi-dimensional protected attributes.
method Bayesian probabilistic modeling approach for reliable, data-efficient estimation of fairness.
result Bayesian methods improve fairness measurement in intersectional contexts.