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

Trend · papers per month

112223335446 · Jun 202019922001200920172026
48 results for Non-local Feature Aggregation

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.

Deep learning has shown its great promise in various biomedical image segmentation tasks. Existing models are typically based on U-Net and rely on an encoder-decoder architecture with stacked local operators to aggregate long-range information gradually. However, only using the local operators limits the efficiency and…

2018-12-10abs ↗pdf ↗

This paper improves image super-resolution by integrating cross-scale non-local attention.

problem Improving image super-resolution by leveraging long-range and cross-scale feature correlations.
method Proposes a Cross-Scale Non-Local (CS-NL) attention module integrated into a recurrent neural network.
result Significantly improved performance on SISR benchmarks.

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 ↗

Deep learning model predicts traffic flows across entire network for multiple steps ahead.

problem Accurately forecasting future traffic flows across all network links.
method Spatial-Temporal Sequence to Sequence (STSeq2Seq) model combining seq2seq and graph convolution.
result STSeq2Seq achieves state-of-the-art performance in traffic forecasting.

We introduce a notion of non-local almost minimal boundaries similar to that introduced by Almgren in geometric measure theory. Extending methods developed recently for non-local minimal surfaces we prove that flat non-local almost minimal boundaries are smooth. This can be viewed as a non-local version of the Almgren-…

2010-03-12abs ↗pdf ↗

Aggregates predictions from multiple regression models using random projections and kernel methods.

problem Combining predictions from multiple regression models to improve accuracy.
method Random projection of high-dimensional feature space, followed by kernel-based consensual aggregation.
result The aggregation scheme performs similarly to using the original high-dimensional features, with high probability.

The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.

problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.

Enhances graph neural networks by considering feature similarities in node aggregation.

problem Ignoring node feature similarities in traditional graph aggregation schemes.
method Interprets node aggregation as kernel weighting, proposing a framework that considers feature similarities.
result Proposed framework outperforms traditional GCNs in real-world applications.

It is argued that the enlargement of the gauge group found in non-commutative gauge theory is more fundamentally thought of as a consequence of the non-locality of the construction and that it was already encountered in an earlier discussion of a non-local gauge theory.

2009-02-24abs ↗pdf ↗

Proposes a novel MTL approach based on bias-variance analysis.

problem Improving multi-task learning performance through shared knowledge.
method Two-phase iterative aggregation of targets and features using bias-variance analysis.
result Validation on synthetic and real-world datasets demonstrates the effectiveness of the proposed method.

This paper introduces a family of local feature aggregation functions and a novel method to estimate their parameters, such that they generate optimal representations for classification (or any task that can be expressed as a cost function minimization problem). To achieve that, we compose the local feature aggregation…

2017-06-26abs ↗pdf ↗

Fractional porous media equations yield q-Gaussian solutions for stock price returns.

problem Modeling stock price returns using fractional porous media equations.
method Analyzed three types of fractional extensions of the porous media equation.
result Local and non-local fractional extensions fit S&P 500 data better than classical models.

Study shows safely discarding features based on aggregate SHAP values is sound.

problem Discarding features based on aggregate SHAP values without proper justification.
method Investigated the soundness of discarding features based on aggregate SHAP values, proposing to aggregate SHAP values over the extended support.
result A small aggregate SHAP value implies safely discarding the corresponding feature.

Study reveals LLM personas have two distinct components: frame-robust aggregated traits and frame-dependent geometric features.

problem Evaluation of LLM personas via psychometric questionnaires discards within-instance correlation structure.
method Constructed within-instance correlation matrices from IPIP-50 responses and analyzed geometry on SPD manifolds under manipulated question orderings.
result Persona expression comprises two dissociable components: aggregated features (Big Five scores) and geometric features (SPD manifold).

The ability to witness non-local correlations lies at the core of foundational aspects of quantum mechanics and its application in the processing of information. Commonly, this is achieved via the violation of Bell inequalities. Unfortunately, however, their systematic derivation quickly becomes unfeasible as the scena…

2018-08-21abs ↗pdf ↗

Graph convolutional network (GCN) is an emerging neural network approach. It learns new representation of a node by aggregating feature vectors of all neighbors in the aggregation process without considering whether the neighbors or features are useful or not. Recent methods have improved solutions by sampling a fixed …

2018-11-30abs ↗pdf ↗

In this paper, we study global existence and blow up properties to LpL^p norm preserving non-local heat flows. We first study two kinds of LpL^p norm preserving non-local flows and prove that these flows have the global solutions. Finally, we give a example to show that one kind of this heat flow may blow up in $L^{\in…

2009-10-26abs ↗pdf ↗

Simplifies GNN models by selecting important features for node classification.

problem Challenges in analyzing and selecting important features in GNN models.
method Decoupling feature aggregation and depth, using softmax and L2-normalization.
result FSGNN achieves comparable or higher accuracy than state-of-the-art GNN models.

Current approaches for explaining machine learning models fall into two distinct classes: antecedent event influence and value attribution. The former leverages training instances to describe how much influence a training point exerts on a test point, while the latter attempts to attribute value to the features most pe…

2019-01-20abs ↗pdf ↗

MFNs parameterize non-local interactions through matrix equivariant functions, improving graph neural network performance.

problem Challenges in modeling non-local interactions in graphs, such as oversmoothing and oversquashing.
method Matrix Function Neural Networks (MFNs) using resolvent expansions for non-local interactions.
result Achieves state-of-the-art performance in graph benchmarks and captures intricate non-local interactions.

We prove a lower bound for feature dimension in linear MDPs and propose a novel dynamics aggregation framework.

problem The limitation of feature dimension in linear MDPs and the need for efficient hierarchical reinforcement learning.
method We propose a novel dynamics aggregation framework based on structural dynamics and design a provably efficient hierarchical reinforcement learning algorithm.
result Our algorithm achieves a regret of ildeO(dψ3/2H3/2NT) ilde{O} ( d_ψ^{3/2} H^{3/2}\sqrt{ N T} ) and meets the condition dψ3Nd3d_ψ^3 N \ll d^{3} in most real-world 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 ↗

Weather2vec learns representations to adjust for non-local confounding in air pollution studies.

problem Non-local confounding in evaluating environmental policies and climate events on health outcomes.
method weather2vec framework using balancing scores to learn representations of non-local information.
result The framework effectively adjusts for confounding in air pollution studies.

Study non-local isoperimetric energies on spheres using a Riemannian autocorrelation function.

problem Analyse non-local isoperimetric energies on spheres.
method Introduce Riemannian autocorrelation function and use it to reformulate and compute the energies.
result Show that the non-local isoperimetric energies can be reformulated and computed using the Riemannian autocorrelation function.

The paper develops a method for forecasting power consumption at various levels of aggregation.

problem Forecasting power consumption at different levels of household aggregation.
method Three-step process: feature generation, aggregation, and projection.
result The method provides theoretical guarantees on prediction error and performs well on real data.

Scientific discovery is limited by hypothesis redundancy, and hybrid methods can exploit non-local exploration.

problem Limitation of scientific discovery due to hypothesis redundancy.
method Hybrid discovery systems combining structured local search with LLM-generated non-local proposals.
result Hybrid methods can exploit non-local exploration when three geometric conditions co-occur.

In this paper, we consider a kind of area preserving non-local flow for convex curves in the plane. We show that the flow exists globally, the length of evolving curve is non-increasing, and the curve converges to a circle in C^{\infty} sense as time goes into infinity.

2009-07-09abs ↗pdf ↗

Approach for modeling EHR data with rare features, improving prediction and interpretation.

problem Challenges in modeling rare binary features in EHR data.
method Tree-guided feature selection and logic aggregation for large-scale regression.
result Improved prediction and model interpretation of suicide risk in EHR data.