Research
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,695 papers · 148 categories

Trend · papers per month

3774110147 · Jun 202019922001200920172026
48 results for unstructured nodes

Recently, graph neural networks (GNNs) have proved to be suitable in tasks on unstructured data. Particularly in tasks as community detection, node classification, and link prediction. However, most GNN models still operate with static relationships. We propose the Graph Learning Network (GLN), a simple yet effective p…

2019-05-29abs ↗pdf ↗

Paper provides conditions for reliable use of pre-trained embeddings in econometrics.

problem Uncertainty in using pre-trained embeddings for econometric tasks.
method Derives sufficient conditions and convergence rates for machine learning models with pre-trained embeddings.
result Establishes theoretical foundations for reliable use of pre-trained embeddings in econometrics.

This paper explains how transformers learn from unstructured data in ICL.

problem Understanding how transformers learn from unstructured data in in-context learning.
method A simple transformer model with one or two attention layers and positional encoding is used to study the role of each component in ICL.
result A transformer with two attention layers and a look-ahead attention mask can learn from unstructured data.

SparseRT accelerates sparse computations on GPUs for deep learning inference.

problem Efficiently handling unstructured sparsity patterns on GPUs for deep learning.
method SparseRT, a code generator that leverages unstructured sparsity for accelerating sparse linear algebra operations.
result Geometric mean speedups of 3.4x at 90% sparsity and 5.4x at 95% sparsity for 1x1 convolutions and fully connected layers.

Study introduces a benchmark suite for evaluating neural MI estimators on real-world unstructured datasets.

problem Lack of comprehensive evaluation methods for neural MI estimators on real-world unstructured datasets.
method Developed a benchmark suite using same-class sampling and a binary symmetric channel trick.
result Showed accurate manipulation of true MI values of real-world datasets.

LLMs learn new tasks from unstructured data, but it depends on word co-occurrence and positional information.

problem Understanding how LLMs can learn new tasks from unstructured data without explicit training.
method Examined the capabilities of LLMs trained on unstructured data, focusing on sequence model requirements and training data structure.
result Many ICL capabilities can emerge from word co-occurrence in unstructured data, but positional information is crucial for certain tasks.

Develops ΦΦ-DVAE for assimilating unstructured data into physical models.

problem Challenges in incorporating unstructured data into physical models.
method Physics-informed dynamical variational autoencoder (ΦΦ-DVAE) combining latent state-space model and VAE.
result Demonstrates data-efficient dynamics encoding with competitive performance and uncertainty quantification.

Unstructured data refers to information that does not have a predefined data model or is not organized in a pre-defined manner. Loosely speaking, unstructured data refers to text data that is generated by humans. In after-sales service businesses, there are two main sources of unstructured data: customer complaints, wh…

2016-07-26abs ↗pdf ↗

Data fields sampled on irregularly spaced points arise in many applications in the sciences and engineering. For regular grids, Convolutional Neural Networks (CNNs) have been successfully used to gaining benefits from weight sharing and invariances. We generalize CNNs by introducing methods for data on unstructured poi…

2019-09-07abs ↗pdf ↗

We investigate ways in which to improve the interpretability of LDA topic models by better analyzing and visualizing their outputs. We focus on examining what we refer to as topic similarity networks: graphs in which nodes represent latent topics in text collections and links represent similarity among topics. We descr…

2014-09-26abs ↗pdf ↗

GPI uses GenAI models to infer causal and predictive effects from unstructured data.

problem Estimating causal and predictive effects from unstructured data like text and images.
method Leverages open-source GenAI models to generate and represent unstructured data, applying machine learning to these representations.
result GPI efficiently estimates causal and predictive effects with quantified uncertainty, without fine-tuning.

Enhanced regime shifts detection using unstructured text and financial data.

problem Detecting regime shifts in financial markets is challenging due to noisy and multicollinear data.
method Combines LLM reasoning on unstructured text and statistical validation on financial time series.
result Framework achieves F1 score of 0.82, outperforming pure data-driven methods.

Develops methods to improve demand counterfactuals from imperfect proxies.

problem Imperfect proxies in demand models lead to biased counterfactuals and invalid inference.
method Practical toolkit for market-level and individual data, requiring minimal computation.
result Improves substitution prediction and counterfactual performance.

TSRGA scales multivariate linear regression for feature-distributed data.

problem Multivariate linear regression for feature-distributed data with high dimensions and many computing nodes.
method Two-stage relaxed greedy algorithm (TSRGA) for multivariate linear regression.
result TSRGA is highly scalable and can yield low-rank coefficient estimates.

A new method monitors unstructured 3D shapes without registration.

problem Error-prone registration and mesh reconstruction steps in PCD monitoring.
method Intrinsic geometric properties of shapes, using Laplacian and geodesic distances.
result Effective monitoring of defects without registration and mesh reconstruction.

This paper compares unstructured and structured EM-based semi-supervised learning methods.

problem Semi-supervised learning with EM algorithm for structured prediction.
method Comparative study between unstructured and structured EM-based semi-supervised learning methods.
result Structured EM is more robust to class confusion in flood mapping datasets.

Automated tests detect interactions in unstructured data.

problem Detecting interactions between latent variables in low-dimensional systems.
method Derive two interaction tests based on pairwise interventions and integrate them into an active learning pipeline.
result Tests can identify more known biological interactions than random search and standard active learning baselines.

Quantum algorithm finds extrema in discrete optimisation problems.

problem Finding extrema in discrete optimisation functions.
method Quantum unstructured search algorithm (QSERA) to map and find extrema.
result Quadratic speed-up over classical algorithms for discrete optimisation.

Study copyright's impact on creative industries using AI-generated fonts.

problem Estimating supply and demand in creative industries with AI-generated content.
method Neural network embeddings, spatial regression, event-study analyses, structural model of supply and demand.
result Copyright can raise consumer welfare by encouraging product relocation.

To date, there have been massive Semi-Structured Documents (SSDs) during the evolution of the Internet. These SSDs contain both unstructured features (e.g., plain text) and metadata (e.g., tags). Most previous works focused on modeling the unstructured text, and recently, some other methods have been proposed to model …

2015-07-30abs ↗pdf ↗

Bayesian method for semi-structured models accounts for both types of uncertainty.

problem Lack of work on epistemic uncertainty in semi-structured regression models.
method Bayesian approximation with subspace inference for joint posterior sampling.
result Validated approach recovers structured effect posteriors and approaches full-space posterior.

HCC extends conformal prediction to handle class hierarchies, improving prediction reliability.

problem Uncertainty quantification in classification models with class hierarchy considerations.
method Formulates HCC as a constrained optimization problem, ensuring coverage guarantees with a smaller subset of candidate solutions.
result HCC produces more reliable prediction sets by leveraging class hierarchy information.

Weak supervision enables learning causal representations from unstructured data.

problem Learning high-level causal representations from unstructured data like images.
method Weakly supervised setting with paired samples before and after interventions. Implicit latent causal models using variational autoencoders.
result Models can reliably identify causal structure and disentangle causal variables.

The paper improves Bayesian precision matrix estimation for high-dimensional sparse data.

problem Estimating sparse precision matrices in high-dimensional settings.
method Tempered posterior with fully specified horseshoe prior.
result Concentration results and theoretical oracle inequality for posterior.

A new model improves semi-supervised learning for unstructured data.

problem Manual labeling of unstructured data is expensive, time-consuming, and prone to errors.
method Batch Semi-Supervised Self-Organizing Map (Batch SS-SOM) integrating deep learning techniques.
result Batch SS-SOM performs well in semi-supervised classification and clustering, even with few labeled samples.