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

69138207276 · Jun 202019922001200920172026
48 results for Feature-based Graphs

The paper presents a method for analyzing shape graphs using specific features.

problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.

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.

New graph representation learning network improves scalability and feature integration.

problem Scalability and feature integration in graph neural networks for large, dense graphs.
method Adaptive sampling of neighbours based on weighted multi-step transition probabilities.
result Comparable or better results on various graph benchmarks.

Graph classification improved using spectral features and wavelet filters.

problem Categorizing graphs based on their structure and node attributes.
method Derived spectral features from graph signal processing, designed two Gaussian process models: one simple and one sophisticated.
result Simple and sophisticated Gaussian process models yield competitive performance, including well-calibrated uncertainty estimates.

Graphs from features improve classification accuracy in tasks.

problem Traditional classification tasks can be improved by incorporating relational information.
method Construct geometric graphs from features and use them in Graph Convolutional Networks.
result Graphs derived from features increase classification accuracy and improve class separation.

Unified framework for feature-based explanations using ANOVA and game theory.

problem Differences between feature-based explanations methods limit their applicability.
method Introduces a unified framework combining fANOVA and cooperative game theory.
result Uncovered similarities and differences between various explanation techniques.

Numerous social, medical, engineering and biological challenges can be framed as graph-based learning tasks. Here, we propose a new feature based approach to network classification. We show how dynamics on a network can be useful to reveal patterns about the organization of the components of the underlying graph where …

2017-05-30abs ↗pdf ↗

Two algorithms achieve optimal logarithmic regret in feature-based dynamic pricing.

problem Optimal pricing for products with features based on online learning.
method Developed EMLP and ONSP algorithms for stochastic and adversarial settings, proving O(dlogT)O(d\log{T}) regret bounds.
result Achieved optimal O(dlogT)O(d\log{T}) regret, improving over existing bounds.

SRR detects early signs of financial crises using multi-layer graphs.

problem Predicting systemic financial transitions from evolving market interactions.
method Systemic Risk Radar (SRR) models financial markets as multi-layer graphs.
result Graph-derived features provide useful early-warning signals compared to feature-based models.

GAEs are shown to be implicitly contrastive learners, revealing new design axes.

problem Understanding and improving graph autoencoders.
method Reinterpret GAEs as contrastive learners, identifying asymmetric views.
result Interpreting GAEs as contrastive learners offers clearer model understanding and design guidance.

Study agnostic feature-based dynamic pricing models with linear policies and noisy valuations.

problem Tackles dynamic pricing with unknown noise and no assumptions on data.
method Studies two agnostic models: linear policy and linear noisy valuation, presenting algorithms and regret bounds.
result Demonstrates no-regret learning is possible under weak assumptions, but noisy feedback is not significantly more useful than bandit feedback.

Convolutional neural networks (CNNs) have achieved great success on grid-like data such as images, but face tremendous challenges in learning from more generic data such as graphs. In CNNs, the trainable local filters enable the automatic extraction of high-level features. The computation with filters requires a fixed …

2018-08-12abs ↗pdf ↗

New model combines shape and feature-based measures for better time series classification.

problem Limited approaches in time series classification lead to poor results for some classes.
method Proposes a new model that automatically decides between shape and feature-based measures.
result Improves classification accuracy statistically significantly on real-world datasets.

A new method uses Gaussian Processes for feature-based nonrigid image registration.

problem Estimating dense displacement fields for nonrigid image registration.
method Using Gaussian Processes to estimate both dense displacement field and uncertainty map.
result GP-based interpolation performs similarly to state-of-the-art B-spline interpolation.

Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objec…

2013-01-28abs ↗pdf ↗

GRANITE unifies feature-based explanation methods to reduce disagreement.

problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.

Knowledge graphs, on top of entities and their relationships, contain other important elements: literals. Literals encode interesting properties (e.g. the height) of entities that are not captured by links between entities alone. Most of the existing work on embedding (or latent feature) based knowledge graph analysis …

2018-02-03abs ↗pdf ↗

Proposes SimPool for graph pooling using structural similarity features.

problem Challenges in graph pooling due to lack of spatial locality.
method Integrates structural similarity features with a revised pooling layer to propose SimPool.
result SimPool produces node cluster assignments resembling CNN's locality preserving pooling.

GraphDINO learns neuronal morphologies from unlabeled data.

problem Unsupervised learning of neuronal morphologies from unlabeled data.
method Transformer-based approach with novel attention mechanism and data augmentation.
result GraphDINO yields morphological clusterings on par with expert classification.

Unified model combines GCN and LPA for better node classification.

problem Combining GCN and LPA for improved node classification.
method Unified model that unifies GCN and LPA, learns edge weights and attention weights.
result Unified model outperforms state-of-the-art GCN-based methods in node classification accuracy.

Rating Prediction is a basic problem in Recommender System, and one of the most widely used method is Factorization Machines(FM). However, traditional matrix factorization methods fail to utilize the benefit of implicit feedback, which has been proved to be important in Rating Prediction problem. In this work, we consi…

2014-10-29abs ↗pdf ↗

GCN adapted for graphs with missing features, improving performance.

problem GCN struggles with graphs containing missing features.
method Integrates missing feature processing within GCN architecture using Gaussian Mixture Model.
result Significantly outperforms imputation-based methods in node classification and link prediction.

GEM improves recommendation by capturing complex feature interactions.

problem Capturing complex high-order interaction signals in feature-based recommendation models.
method Integrates graph convolution networks to generate high-order embeddings and combines with FM-based models.
result Significant improvement in recommendation performance over baselines.

The task of determining a speaker's native language based only on his speeches in a second language is known as Native Language Identification or NLI. Due to its increasing applications in various domains of speech signal processing, this has emerged as an important research area in recent times. In this paper we have …

2018-11-09abs ↗pdf ↗

Link prediction requires predicting which new links are likely to appear in a graph. Being able to predict unseen links with good accuracy has important applications in several domains such as social media, security, transportation, and recommendation systems. A common approach is to use features based on the common ne…

2019-02-08abs ↗pdf ↗

SELO model predicts link signs better than SDGNN using subgraph encoding and linear optimization.

problem Inferring the sign of links in signed networks with limited sign data.
method Subgraph Encoding via Linear Optimization (SELO) approach to learn edge embeddings.
result SELO model outperforms state-of-the-art methods on multiple real-world signed networks.

Domain adaptation has become a prominent problem setting in machine learning and related fields. This review asks the question: how can a classifier learn from a source domain and generalize to a target domain? We present a categorization of approaches, divided into, what we refer to as, sample-based, feature-based and…

2019-01-16abs ↗pdf ↗

A new method for dynamic feature selection outperforms existing approaches.

problem Sequentially selecting features based on current information in machine learning.
method Greedy selection of features based on conditional mutual information, combined with a learning approach for optimization.
result The method outperforms existing feature selection methods in experiments.

Capturing the dynamical properties of time series concisely as interpretable feature vectors can enable efficient clustering and classification for time-series applications across science and industry. Selecting an appropriate feature-based representation of time series for a given application can be achieved through s…

2019-01-29abs ↗pdf ↗

Improves machine learning models by incorporating physical laws into feature maps.

problem Lack of model interpretability in classical machine learning approaches.
method Physics-informed feature maps constructed from physical laws and dimensional analysis.
result Enhanced model interpretability and potential discovery of new physical equations.

Energy-efficient detection of natural errors in deep networks.

problem Deep networks lack error detection capability without additional energy costs.
method Append RACs at hidden layers to detect natural errors with early classification termination.
result Early classification termination reduces energy consumption.

Micro-panel data are collected and analysed in many research and industry areas. Cluster analysis of micro-panel data is an unsupervised learning exploratory method identifying subgroup clusters in a data set which include homogeneous objects in terms of the development dynamics of monitored variables. The supply of cl…

2018-07-16abs ↗pdf ↗

Privacy and transparency are two key foundations of trustworthy machine learning. Model explanations offer insights into a model's decisions on input data, whereas privacy is primarily concerned with protecting information about the training data. We analyze connections between model explanations and the leakage of sen…

2019-06-29abs ↗pdf ↗

New algorithm improves interpretability in sequence classification.

problem Lack of human-independent interpretability metrics in sequence classification.
method Combines linear classifiers with background knowledge embeddings to create a new feature space.
result Preserves predictive power while delivering more interpretable models.

Paper introduces privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand.

problem Privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand distribution and nonsmooth loss function.
method Developed a clipped noisy gradient descent algorithm based on convolution smoothing for optimal inventory estimation within f-differential privacy framework.
result Achieved privacy-preserving optimal inventory policy with provable privacy guarantees and desirable statistical precision.

Feature-based time series representations have attracted substantial attention in a wide range of time series analysis methods. Recently, the use of time series features for forecast model averaging has been an emerging research focus in the forecasting community. Nonetheless, most of the existing approaches depend on …

2019-04-17abs ↗pdf ↗