To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictionary. A new formulation of sparse coding is proposed which enables high dimensional tensors dictiona…
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.
168,742 papers · 148 categories
Trend · papers per month
35 results for “dictionary-based”
A tale of two toolkits, report the second: bake off redux. Chapter 1. dictionary based classifierscs.LG
Four dictionary-based TSC algorithms are compared in a bake-off.
problem Comparing four dictionary-based time series classification algorithms.
method Four algorithms are compared using predictive performance, time and space complexity.
result Improved accuracy can be achieved but at higher computational cost.
This work tackles sparse coding in DLRA for interpretable multiway data.
problem Sparse coding in DLRA for interpretable multiway data.
method Proposes a new sparse-coding subproblem (MSC) and several algorithms to solve it.
result DLRA extends low-rank approximations, reducing variance and enhancing interpretability.
The success of deep learning models is heavily tied to the use of massive amount of labeled data and excessively long training time. With the emergence of intelligent edge applications that use these models, the critical challenge is to obtain the same inference capability on a resource-constrained device while providi…
Bayesian Optimization over High-Dimensional Combinatorial Spaces via Dictionary-based Embeddingscs.LG
Bayesian optimization for high-dimensional combinatorial spaces using embeddings.
problem Optimizing expensive functions over large, complex input spaces.
method Dictionary-based ordinal embeddings for high-dimensional combinatorial structures, using Gaussian process models.
result The proposed method outperforms state-of-the-art BO methods on diverse real-world benchmarks.
Method estimates joint probability density from samples using low-rank decomposition and random projections.
problem Estimating joint probability density from limited samples.
method Low-rank tensor decomposition, dictionaries, and Radon transforms.
result Algorithm outperforms previous methods in estimating synthetic probability densities.
ROM-net framework applies to industrial design uncertainty quantification.
problem Uncertainty quantification in industrial design models.
method Dictionary-based ROM-net framework for reduced order modeling.
result ROM-net computes predictions in 2 hours with high accuracy.
A novel dictionary-based approach for predicting functions.
problem Functional-output regression with non-orthogonal dictionaries.
method Projection learning (PL) with reproducing kernel Hilbert spaces (KPL).
result KPL offers a flexible and computationally efficient solution.
A novel framework infers causal direction from symbolic sequences using pattern entropy.
problem Challenges in discovering causal direction from temporal symbolic data.
method Dictionary Based Pattern Entropy () framework integrating AIT and Shannon Information Theory.
result Minimizing pattern level uncertainty yields a robust framework for causal discovery.
Transformer models improve financial sentiment measurement.
problem Capturing nuanced sentiment from financial news articles.
method Transformer-based language models for sentiment classification and aggregation.
result Transformer models outperform traditional dictionary-based methods in sentiment classification.
We analyze the decomposition of a data matrix, assumed to be a superposition of a low-rank component and a component which is sparse in a known dictionary, using a convex demixing method. We provide a unified analysis, encompassing both undercomplete and overcomplete dictionary cases, and show that the constituent comp…
A family of algorithms for time series classification (TSC) involve running a sliding window across each series, discretising the window to form a word, forming a histogram of word counts over the dictionary, then constructing a classifier on the histograms. A recent evaluation of two of this type of algorithm, Bag of …
Dictionary based classifiers are a family of algorithms for time series classification (TSC), that focus on capturing the frequency of pattern occurrences in a time series. The ensemble based Bag of Symbolic Fourier Approximation Symbols (BOSS) was found to be a top performing TSC algorithm in a recent evaluation, as w…
Locally-adapted convolution-based super-resolution of irregularly-sampled ocean remote sensing datastat.ML
Super-resolution is a classical problem in image processing, with numerous applications to remote sensing image enhancement. Here, we address the super-resolution of irregularly-sampled remote sensing images. Using an optimal interpolation as the low-resolution reconstruction, we explore locally-adapted multimodal conv…
Sparse representations using data dictionaries provide an efficient model particularly for signals that do not enjoy alternate analytic sparsifying transformations. However, solving inverse problems with sparsifying dictionaries can be computationally expensive, especially when the dictionary under consideration has a …
Motivated by the need to automate medical information extraction from free-text radiological reports, we present a bi-directional long short-term memory (BiLSTM) neural network architecture for modelling radiological language. The model has been used to address two NLP tasks: medical named-entity recognition (NER) and …
Many signal processing and machine learning methods share essentially the same linear-in-the-parameter model, with as many parameters as available samples as in kernel-based machines. Sparse approximation is essential in many disciplines, with new challenges emerging in online learning with kernels. To this end, severa…
We consider the decomposition of a data matrix assumed to be a superposition of a low-rank matrix and a component which is sparse in a known dictionary, using a convex demixing method. We consider two sparsity structures for the sparse factor of the dictionary sparse component, namely entry-wise and column-wise sparsit…
Mining financial text documents and understanding the sentiments of individual investors, institutions and markets is an important and challenging problem in the literature. Current approaches to mine sentiments from financial texts largely rely on domain specific dictionaries. However, dictionary based methods often f…
New method uses generative priors for compressive sensing with sparse solutions.
problem Fundamental linear inverse problem in compressive sensing.
method Sparse Bayesian learning with conditional Gaussianity.
result Ability to learn from few compressed and noisy samples without optimization.
New distress dictionary improves bankruptcy prediction from disclosure text.
problem Bankruptcy prediction from financial disclosures.
method Proposes a distress dictionary based on managers' sentences, quantifies linguistic features, and builds predictive models.
result Predictive models based on the distress dictionary outperform existing methods.
PD-PINNs accelerate PINN training by incorporating task-specific dictionaries.
problem Training PINNs is slow and lacks theoretical error bounds.
method Integrates task-dependent dictionaries into PINNs to enhance convergence.
result PD-PINNs achieve faster convergence and bounded prediction errors.
This paper introduces a fast, general method for dictionary-free parameter estimation in quantitative magnetic resonance imaging (QMRI) via regression with kernels (PERK). PERK first uses prior distributions and the nonlinear MR signal model to simulate many parameter-measurement pairs. Inspired by machine learning, PE…
A Dictionary-Based Generalization of Robust PCA Part II: Applications to Hyperspectral Demixingcs.CV
We consider the task of localizing targets of interest in a hyperspectral (HS) image based on their spectral signature(s), by posing the problem as two distinct convex demixing task(s). With applications ranging from remote sensing to surveillance, this task of target detection leverages the fact that each material/obj…
Traditional sentiment construction in finance relies heavily on the dictionary-based approach, with a few exceptions using simple machine learning techniques such as Naive Bayes classifier. While the current literature has not yet invoked the rapid advancement in the natural language processing, we construct in this re…
From STLS to Projection-based Dictionary Selection in Sparse Regression for System Identificationstat.ML
This work improves SINDy-type algorithms for system identification using score-guided dictionary selection.
problem Improving accuracy and interpretability in dynamical system identification.
method Score-guided library selection to refine dictionary terms in sparse regression.
result Score-guided methods enhance SINDy's robustness in discovering governing equations.
The paper improves cryptocurrency price forecasting using deep learning and NLP on financial, blockchain, and social media data.
problem Improving cryptocurrency price forecasting accuracy and profitability.
method Integrates financial, blockchain, and social media data; applies BART MNLI model for sentiment analysis; uses deep learning NLP models; compares with traditional methods; uses local extrema as predictive targets.
result Significantly improves forecasting accuracy and profitability of cryptocurrency price predictions.
Speech Acts (SAs) are one of the important areas of pragmatics, which give us a better understanding of the state of mind of the people and convey an intended language function. Knowledge of the SA of a text can be helpful in analyzing that text in natural language processing applications. This study presents a diction…
GUIDE-VAE generates user-guided data with improved realism and performance.
problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.
High-dimensional big data appears in many research fields such as image recognition, biology and collaborative filtering. Often, the exploration of such data by classic algorithms is encountered with difficulties due to `curse of dimensionality' phenomenon. Therefore, dimensionality reduction methods are applied to the…
EmTract extracts emotions from financial social media text.
problem Understanding investor emotions in financial markets.
method Annotated data, DistilBERT model, embedding space augmentation.
result EmTract outperforms existing emotion classifiers.
Paper presents J-RFDL for robust DL in compressed space, improving data representation robustness and accuracy.
problem Improving data representation robustness and accuracy in the presence of noise and outliers.
method Joint Robust Factorization and Projective Dictionary Learning (J-RFDL) in a factorized compressed space.
result Delivers superior performance in data representation and classification over state-of-the-art methods.
A new transformer model corrects diacritics and typos in multiple languages.
problem Restoring diacritics and correcting typos in online communications.
method Employing a universal ByT5 transformer model trained on 12 languages, including Lithuanian.
result Achieves > 98% accuracy in diacritics restoration and typos correction.
Narrative disclosures in 10-K filings improve bankruptcy prediction beyond accounting ratios.
problem Traditional bankruptcy prediction models rely on accounting ratios, which may not capture early warning signals.
method Developed a PB Stress Score based on distress-specific language in 10-K narratives, evaluated against accounting and dictionary benchmarks.
result Adding the PB Stress Score increases AUC from 0.8323 to 0.9019 and improves top-decile bankruptcy capture from 44.12% to 64.71%.
Bayesian imaging methods deliver trustworthy probabilities in some cases but struggle with uncertainty quantification.
problem Uncertainty quantification in Bayesian imaging methods.
method Monte Carlo method to explore reliability of probabilities.
result Modern Bayesian imaging techniques deliver reliable probabilities in some cases but not for uncertainty quantification.