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

Trend · papers per month

1.1%2.2%3.3%4.4% · Aug 202019922001200920172026
48 results for citation recommendation

Advances citation and subject label recommendation using multi-modal adversarial autoencoders.

problem Improving recommendation systems for citations and subject labels.
method Multi-modal adversarial autoencoders with adversarial regularization, sparsity, and input modality analysis.
result Adversarial regularization consistently improves recommendation performance.

Measuring the impact of scientific articles is important for evaluating the research output of individual scientists, academic institutions and journals. While citations are raw data for constructing impact measures, there exist biases and potential issues if factors affecting citation patterns are not properly account…

2015-02-25abs ↗pdf ↗

Visuals in scientific papers are used to express complex ideas; this study uses them to identify knowledge domains.

problem Scientific figures are underutilized in literature analysis.
method Encoded scientific figures into visual signatures and used distances between signatures to compare communities of practice.
result Figures can differentiate knowledge domains as effectively as text or citation patterns.

Develops a deep learning architecture for rich-item recommendations.

problem Rich data structures with multiple entity types and side-information.
method General formulation, multiple graph-CNN based architecture (AL-GCN), ranking metric pAp@k.
result 5-6% points more accurate than production models in real-world applications.

In recent years, there has been a surge of interest in developing deep learning methods for non-Euclidean structured data such as graphs. In this paper, we propose Dual-Primal Graph CNN, a graph convolutional architecture that alternates convolution-like operations on the graph and its dual. Our approach allows to lear…

2018-06-03abs ↗pdf ↗

A multi-task model tackles citation purpose classification with limited data.

problem Classifying citations based on their purpose is challenging due to limited labeled data and subjectivity.
method Combines linguistic features, TF-IDF, and an LSTM-with-attention model for multi-task learning.
result Improves classification accuracy compared to single-task models.

Synthetic reference strings are as effective as real ones for training citation parsing models.

problem Lack of training data for citation parsing, especially with deep neural networks.
method Trained Grobid with human-labelled and synthetically created reference strings, and evaluated retraining and out-of-sample data impact.
result Synthetic and real reference strings are equally effective for training Grobid, with retraining improving performance.

A combined model integrates latent factor and logistic regression for citation network analysis.

problem Insufficient representation by either latent factor or logistic regression alone.
method Proposes a combined model integrating latent factor and logistic regression, with parameter estimation through joint-likelihood and penalty terms.
result The proposed method captures both main technological trends and ad-hoc dependencies in citation networks.

Modeling generative process of growing graphs has wide applications in social networks and recommendation systems, where cold start problem leads to new nodes isolated from existing graph. Despite the emerging literature in learning graph representation and graph generation, most of them can not handle isolated new nod…

2019-03-06abs ↗pdf ↗

Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches …

2017-06-07abs ↗pdf ↗

This paper asks, "Do classics exist in megaproject management?" We identify three types of classic texts: conventional, Kuhnian, and citation classics. We find that the answer to our question depends on the definition of "classic" employed. First, "citation classics" do exist in megaproject management, and they perform…

2017-09-06abs ↗pdf ↗

Bibliographic analysis considers author's research areas, the citation network and paper content among other things. In this paper, we combine these three in a topic model that produces a bibliographic model of authors, topics and documents using a non-parametric extension of a combination of the Poisson mixed-topic li…

2016-09-22abs ↗pdf ↗

Improved AI patent classifier measures U.S. and China's AI patenting.

problem Measuring AI patents with high precision and generalization.
method Fine-tuning PatentSBERTa on manually labeled data from USPTO's AI Patent Dataset.
result Rapid growth in AI patenting in both countries, but different organizational patterns.

Many data sets contain rich information about objects, as well as pairwise relations between them. For instance, in networks of websites, scientific papers, and other documents, each node has content consisting of a collection of words, as well as hyperlinks or citations to other nodes. In order to perform inference on…

2013-03-28abs ↗pdf ↗

A novel model-selection method for dynamic networks using synthetic data.

problem Classifying and understanding the growth mechanisms of dynamic networks.
method Training a classifier on synthetic network data generated by nine random graph models, using dynamic features that count new links.
result Achieves near-perfect classification of synthetic networks, outperforming state-of-the-art methods.

Paper introduces a core-periphery model for identifying informative network structures.

problem Noise and bias in non-informative periphery structures obscure the informative core in complex networks.
method Spectral algorithms for core identification as a preprocessing step for network analysis.
result The proposed method outperforms traditional core-periphery methods in various downstream tasks.

Proposes dynamic graph and node feature learning in GCNNs for better adaptability.

problem Fixed graphs for all GCNN layers limit adaptability to node feature structures.
method Dynamic graph and node feature learning using Mahalanobis distance metric.
result Superior performance in point clouds and citation networks.

DREAM model improves computational efficiency for non-linear effects in relational event models.

problem Efficiently modeling non-linear effects in dynamic relational networks.
method Introduces Deep Relational Event Additive Model (DREAM) using Neural Additive Models.
result Demonstrates superior computational efficiency compared to traditional REM approaches.

Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.

problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.

In sustained growth with random dynamics stationary distributions can exist without detailed balance. This suggests thermodynamical behavior in fast growing complex systems. In order to model such phenomena we apply both a discrete and a continuous master equation. The derivation of elementary rates from known stationa…

2016-11-21abs ↗pdf ↗

CAFL breaks feedback loops in recommender systems using causal inference.

problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.

DeepFair improves fairness in recommender systems without sacrificing accuracy.

problem Lack of bias management in recommender systems leads to unfair recommendations for minority groups.
method Deep Learning based Collaborative Filtering algorithm that balances fairness and accuracy.
result It is possible to make fair recommendations without losing significant accuracy.

Machine learning models learn what we teach them to learn. Machine learning is at the heart of recommender systems. If a machine learning model is trained on biased data, the resulting recommender system may reflect the biases in its recommendations. Biases arise at different stages in a recommender system, from existi…

2019-05-10abs ↗pdf ↗

The paper aims to define a benchmark for deep learning recommendation models.

problem Insufficient benchmarking for deep learning recommendation models.
method Synthesizes modeling strategies, defines desirable characteristics, and summarizes advice from the MLPerf Recommendation Advisory Board.
result Defines an industry-relevant benchmark for deep learning recommendation models.

Interprets feature interactions in ad-click prediction models.

problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.

Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually ignore the diversity of the recommendation results, thus usually results in unsa…

2019-07-01abs ↗pdf ↗

Job recommendation has traditionally been treated as a filter-based match or as a recommendation based on the features of jobs and candidates as discrete entities. In this paper, we introduce a methodology where we leverage the progression of job selection by candidates using machine learning. Additionally, our recomme…

2019-05-28abs ↗pdf ↗

Data poisoning attacks can manipulate recommender systems to recommend target items.

problem Attacks on recommender systems to influence top-N item recommendations.
method Formulated as an optimization problem, solved using influence function to select influential users.
result Effective data poisoning attacks that outperform existing methods.