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

Trend · papers per month

160319479638 · Jun 202019922001200920172026
48 results for local information extraction

Local surrogate explainers vary in objectives, leading to incomparable explanations.

problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.

Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we consider a novel class of matrix and tensor-valued features, which can be pre-trained using unlabeled samples. We present efficient algorithms f…

2014-12-19abs ↗pdf ↗

Linear dimensionality reduction techniques are powerful tools for image analysis as they allow the identification of important features in a data set. In particular, nonnegative matrix factorization (NMF) has become very popular as it is able to extract sparse, localized and easily interpretable features by imposing an…

2015-05-26abs ↗pdf ↗

MaGNet integrates local and global graph information for interpretable results.

problem Lack of interpretability and inability to learn varying-order representations in GNNs.
method Model-agnostic Graph Neural Network (MaGNet) framework integrating estimation and interpretation models.
result MaGNet effectively integrates information of various orders and provides meaningful, interpretable results.

Method models other agents' behaviors without requiring direct observation.

problem Understanding and interacting effectively with other agents in reinforcement learning.
method Extracts representations from local observations of the controlled agent using encoder-decoder architectures.
result The method achieves higher returns than baseline methods in multi-agent environments.

Complex textual information extraction tasks are often posed as sequence labeling or \emph{shallow parsing}, where fields are extracted using local labels made consistent through probabilistic inference in a graphical model with constrained transitions. Recently, it has become common to locally parametrize these models…

2018-09-28abs ↗pdf ↗

New methods identify local clusters in graphs with few labels.

problem Identifying specific substructures in large graphs without additional structural information.
method Random sampling, diffusion, and overlap analysis of local clusters.
result Proves the correctness of the proposed methods and achieves state-of-the-art results.

A new method extracts events and their arguments efficiently from text.

problem Efficiently extract event information from texts with long-range dependencies and associations.
method Graph Convolutional Networks with shortest dependency paths to capture syntactic relationships.
result Significant improvement over state-of-the-art methods.

Anonymization reduces economic signal extraction from financial texts.

problem Reducing meaningful economic signals from financial texts due to anonymization.
method Analyzed the impact of anonymization on textual understanding and economic signal extraction.
result Information loss due to anonymization is severe and pervasive, outweighing its benefits in certain financial applications.

DeepUnHide uses deep learning to reveal hidden demographic features in recommender systems.

problem Extracting hidden demographic features from recommender systems factors.
method Gradient-based localization in deep learning for feature extraction.
result DeepUnHide outperforms state-of-the-art feature selection methods.

Requirements elicitation can be very challenging in projects that require deep domain knowledge about the system at hand. As analysts have the full control over the elicitation process, their lack of knowledge about the system under study inhibits them from asking related questions and reduces the accuracy of requireme…

2018-07-10abs ↗pdf ↗

We propose an approach to self-supervised representation learning based on maximizing mutual information between features extracted from multiple views of a shared context. For example, one could produce multiple views of a local spatio-temporal context by observing it from different locations (e.g., camera positions w…

2019-06-03abs ↗pdf ↗

A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables (X,Y)(X,Y) governed by a given joint distribution, an agent observes YY and wants to convey to a potentially public user as much information about YY as possible without compromising the amount of …

2015-11-07abs ↗pdf ↗

Paper proposes a method to extract style features from unlabeled data.

problem Extracting fine-grained features like styles from unlabeled data.
method Contrastive conditioned variational autoencoders with mutual information constraints.
result The method efficiently extracts style features from real-world natural image datasets.

ECC Analyzer uses LLMs to predict stock volatility from ECCs.

problem Leveraging unstructured ECC data for stock volatility prediction.
method Uses large language models to extract and fuse textual and audio features from ECCs.
result ECC Analyzer outperforms traditional benchmarks in volatility prediction.

Marich extracts high-fidelity models from public data with minimal queries.

problem Creating an accurate replica of a target ML model using few queries.
method Sequentially selects informative queries to maximize entropy and reduce model mismatch.
result Extracted models achieve 60-95% of target model's accuracy with 1,000-8,500 queries.

The digitalization of stored information in hospitals now allows for the exploitation of medical data in text format, as electronic health records (EHRs), initially gathered for other purposes than epidemiology. Manual search and analysis operations on such data become tedious. In recent years, the use of natural langu…

2017-12-06abs ↗pdf ↗

Novel TRI-GNN framework improves graph classification robustness.

problem Graph neural networks suffer from over-smoothing and vulnerability to graph perturbations.
method Integrates higher-order graph information via persistent homology and local graph structure learning.
result TRI-GNN outperforms state-of-the-art baselines on node classification tasks.

This paper presents two unsupervised learning layers (UL layers) for label-free video analysis: one for fully connected layers, and the other for convolutional ones. The proposed UL layers can play two roles: they can be the cost function layer for providing global training signal; meanwhile they can be added to any re…

2017-05-24abs ↗pdf ↗

Method calibrates basket options using rearranged samples from constituent processes.

problem Calibrate basket options with non-linear dependency structure.
method Propose a method to extract dependency structure from market data through systematic sampling rearrangement, then calibrate a local volatility model.
result Efficiently calibrates basket options with near-perfect accuracy.

Purpose: Lung nodules have very diverse shapes and sizes, which makes classifying them as benign/malignant a challenging problem. In this paper, we propose a novel method to predict the malignancy of nodules that have the capability to analyze the shape and size of a nodule using a global feature extractor, as well as …

2019-04-23abs ↗pdf ↗

Paper presents a novel approach for global feature aggregation in Graph Neural Networks.

problem Graphs lack a straightforward way to perform non-local feature aggregation like images and texts.
method Utilizes Latent Fixed Data Structure (LFDS) to aggregate feature vectors from local extraction.
result Proposed methods achieve competitive or better results with linear computational complexity.

We investigate a classification problem using multiple mobile agents capable of collecting (partial) pose-dependent observations of an unknown environment. The objective is to classify an image over a finite time horizon. We propose a network architecture on how agents should form a local belief, take local actions, an…

2019-05-13abs ↗pdf ↗

This paper improves node classification using graph structure and side information.

problem Improving node classification in semi-supervised scenarios.
method Combines graph convolutional networks with extracted side information.
result The proposed model achieves higher prediction accuracy.

CURE extracts relations without supervision by clustering similar entity pairs.

problem Extracting relations unsupervised without considering sentence correlations.
method CURE uses Encoder-Decoder architecture for self-supervised learning and clustering similar relations.
result CURE outperforms state-of-the-art models on NYT and UNPC datasets.

This paper introduces a scalable benchmark for evaluating local posterior sampling in neural networks.

problem Degeneracy in neural network loss landscapes and its impact on SGMCMC algorithms.
method Development of a scalable benchmark for local posterior sampling.
result RMSProp-preconditioned SGLD is most effective at representing the local geometry of the posterior distribution.

Detecting PE malware files is now commonly approached using statistical and machine learning models. While these models commonly use features extracted from the structure of PE files, we propose that icons from these files can also help better predict malware. We propose an innovative machine learning approach to extra…

2017-12-10abs ↗pdf ↗