Authorship identification is a process in which the author of a text is identified. Most known literary texts can easily be attributed to a certain author because they are, for example, signed. Yet sometimes we find unfinished pieces of work or a whole bunch of manuscripts with a wide variety of possible authors. In or…
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
48 results for “text authorship”
Proposes a VAE with Student- mixture model for authorship attribution.
problem Traditional authorship attribution in closed-set scenarios.
method Extends variational autoencoder with embedded Student- mixture model.
result Superior performance over existing methods on Amazon review dataset.
AdaDetectGPT improves text authorship detection with statistical guarantees.
problem Determining if text is authored by a human or an LLM.
method Adaptive learning of a witness function from training data to enhance logits-based detectors.
result AdaDetectGPT nearly uniformly improves text authorship detection, with up to 37% improvement.
This paper proposes to perform authorship analysis using the Fast Compression Distance (FCD), a similarity measure based on compression with dictionaries directly extracted from the written texts. The FCD computes a similarity between two documents through an effective binary search on the intersection set between the …
Modern LLMs fail at authorship attribution without fine-tuning, but topic embeddings outperform them.
problem Authorship attribution of the Federalist Papers using modern LLMs.
method Examined popular LLMs, compared word/phrase embeddings, and used Bayesian analysis with topic embeddings.
result Topic embeddings trained on 'function words' outperform default LLM embeddings in authorship attribution.
Retrieving indexed documents, not by their topical content but their writing style opens the door for a number of applications in information retrieval (IR). One application is to retrieve textual content of a certain author X, where the queried IR system is provided beforehand with a set of reference texts of X. Autho…
We adapt the Higher Criticism (HC) goodness-of-fit test to measure the closeness between word-frequency tables. We apply this measure to authorship attribution challenges, where the goal is to identify the author of a document using other documents whose authorship is known. The method is simple yet performs well witho…
A great variety of text tasks such as topic or spam identification, user profiling, and sentiment analysis can be posed as a supervised learning problem and tackle using a text classifier. A text classifier consists of several subprocesses, some of them are general enough to be applied to any supervised learning proble…
A method for authorship attribution based on function word adjacency networks (WANs) is introduced. Function words are parts of speech that express grammatical relationships between other words but do not carry lexical meaning on their own. In the WANs in this paper, nodes are function words and directed edges stand in…
In this work, we employ quantitative methods from the realm of statistics and machine learning to develop novel methodologies for author attribution and textual analysis. In particular, we develop techniques and software suitable for applications to Classical study, and we illustrate the efficacy of our approach in sev…
Improves authorship attribution accuracy and robustness against adversarial attacks.
problem Vulnerability of authorship attribution approaches to adversarial attacks.
method Formulated a relational adversary threat model and presented a novel learning framework, normalize-and-predict (N&P).
result Improves accuracy on adversarial inputs by up to 70% and robust accuracy by 45%.
Authorship verification (AV) is a research subject in the field of digital text forensics that concerns itself with the question, whether two documents have been written by the same person. During the past two decades, an increasing number of proposed AV approaches can be observed. However, a closer look at the respect…
Guaranteeing a certain level of user privacy in an arbitrary piece of text is a challenging issue. However, with this challenge comes the potential of unlocking access to vast data stores for training machine learning models and supporting data driven decisions. We address this problem through the lens of dx-privacy, a…
Authorship verification tries to answer the question if two documents with unknown authors were written by the same author or not. A range of successful technical approaches has been proposed for this task, many of which are based on traditional linguistic features such as n-grams. These algorithms achieve good results…
In this paper, we present a novel attack against authorship attribution of source code. We exploit that recent attribution methods rest on machine learning and thus can be deceived by adversarial examples of source code. Our attack performs a series of semantics-preserving code transformations that mislead learning-bas…
The versified play Henry VIII is nowadays widely recognized to be a collaborative work not written solely by William Shakespeare. We employ combined analysis of vocabulary and versification together with machine learning techniques to determine which authors also took part in the writing of the play and what were their…
This paper has been withdrawn by arXiv administrators because of disputed claims of authorship among former collaborators
Embeddings leak sensitive information about input data, which can be recovered or inferred.
problem Information leakage in embedding models.
method Developed three classes of attacks to study information leakage.
result Embeddings leak sensitive information about input data, which can be partially recovered or inferred.
We consider peer review in a conference setting where there is typically an overlap between the set of reviewers and the set of authors. This overlap can incentivize strategic reviews to influence the final ranking of one's own papers. In this work, we address this problem through the lens of social choice, and present…
In this paper we do the first large scale analysis of writing style development among Danish high school students. More than 10K students with more than 100K essays are analyzed. Writing style itself is often studied in the natural language processing community, but usually with the goal of verifying authorship, assess…
Two architectures that generalize convolutional neural networks (CNNs) for the processing of signals supported on graphs are introduced. We start with the selection graph neural network (GNN), which replaces linear time invariant filters with linear shift invariant graph filters to generate convolutional features and r…
Text analytics based on supervised machine learning classifiers has shown great promise in a multitude of domains, but has yet to be applied to Seismology. We test various standard models (Naive Bayes, k-Nearest Neighbors, Support Vector Machines, and Random Forests) on a seismological corpus of 100 articles related to…
Paper improves gender detection on social media using deep learning.
problem Traditional classifiers struggle with social media data volume.
method Ensemble deep learning with multi-model architectures.
result Improved gender detection accuracy on social media posts.
Some research institutions demand researchers to distribute the incomes they earn from publishing papers to their researchers and/or co-authors. In this study, we deal with the Impact Factor-based ranking journal as a criteria for the correct distribution of these incomes. We also include the Authorship Credit factor f…
We consider the probabilistic analogue to neural network matrix factorization (Dziugaite & Roy, 2015), which we construct with Bayesian neural networks and fit with variational inference. We find that a linear model fit with variational inference can attain equivalent predictive performance to the regular neural networ…
In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise. Hypergraphs provide a flexible and natural modeling tool to model such complex relationships. The obvious existence of such complex relationships in many real-world networ…
Author2Vec generates user embeddings from social media data.
problem Generating useful user embeddings from noisy social media data.
method End-to-end neural network with BERT sentence representations and unsupervised pre-training.
result Author2Vec outperforms traditional methods in user classification tasks.
In recent years numerous advanced malware, aka advanced persistent threats (APT) are allegedly developed by nation-states. The task of attributing an APT to a specific nation-state is extremely challenging for several reasons. Each nation-state has usually more than a single cyber unit that develops such advanced malwa…
The problem of searching for experts in a given academic field is hugely important in both industry and academia. We study exactly this issue with respect to a database of authors and their publications. The idea is to use Latent Semantic Indexing (LSI) and Latent Dirichlet Allocation (LDA) to perform topic modelling i…
The paper proves an obstruction to immersed curves with specific curvature.
problem Existence of immersed curves with prescribed curvature.
method Proofs and corrections of submitted manuscript.
result An obstruction to the existence of immersed curves of prescribed curvature.
IGT learns graph representations without supervision.
problem Building deep unsupervised graph representations.
method Generic complex-valued spectral graph architecture from Fourier transform generalization, greedy concave objective for discriminative and invariant features.
result IGT learns both discriminative and invariant features from graph topology.
We introduce the author-topic model, a generative model for documents that extends Latent Dirichlet Allocation (LDA; Blei, Ng, & Jordan, 2003) to include authorship information. Each author is associated with a multinomial distribution over topics and each topic is associated with a multinomial distribution over words.…
Scene Text Magnifiercs.CV
Scene text magnifier aims to magnify text in natural scene images without recognition. It could help the special groups, who have myopia or dyslexia to better understand the scene. In this paper, we design the scene text magnifier through interacted four CNN-based networks: character erasing, character extraction, char…
The paper classifies actions of a specific group on certain manifolds.
problem Classifying analytic actions of a specific semi-orthogonal group on manifolds.
method Adapting Uchida's construction, the paper explicitly constructs actions on specific manifolds and demonstrates that any action is covered by these.
result Any analytic action of the semi-orthogonal group on a closed, connected manifold is covered by the constructed actions.
The paper solves the Nielsen realization problem for high degree del Pezzo surfaces.
problem Which finite subgroups of the mapping class group of a del Pezzo surface lift to the diffeomorphism group?
method Classification and partial answers for , equivariant connected sum for .
result Complete classification for , partial answer for .
We establish a gluing construction for Higgs bundles over a connected sum of Riemann surfaces in terms of solutions to the -Hitchin equations using the linearization of a relevant elliptic operator. The construction can be used to provide model Higgs bundles in all the exce…
A new text representation model combines CNN and VAE for better semantic extraction.
problem Difficult to effectively extract semantic features and distinguish polysemy in text data.
method Integrates CNN for feature extraction and VAE for consistent Gaussian distribution.
result The model outperforms traditional classification algorithms in text classification tasks.
We propose two algorithms that can find local minima faster than the state-of-the-art algorithms in both finite-sum and general stochastic nonconvex optimization. At the core of the proposed algorithms is using stochastic nested variance reduction (Zhou et al., 2018a), which outperforms the s…
New families of Lie groups with special foliations discovered.
problem Characterizing left-invariant foliations on semi-Riemannian Lie groups.
method Classifying foliations generated by specific subgroups.
result Constructing new families of Lie groups with conformal minimal foliations.
Improved text summarization using belief propagation on weighted bipartite graphs.
problem Text summarization from a graph theory perspective.
method Generalized belief propagation algorithm for weighted bipartite graphs.
result Our algorithm outperforms greedy methods in text summarization tasks.
New TC variant dTC better fits motion planning for some systems.
problem Improving motion planning for autonomous systems.
method Defined and computed new homotopy invariant dTC.
result dTC and dcat provide better motion planning solutions.
Let denote the category of closed, connected, oriented and based -manifolds, with basepoint preserving diffeomorphisms between them. Juhász, Thurston and Zemke showed that the Heegaard Floer invariants are natural with respect to diffeomorphisms, in the sense that there are functors $HF^{\circ}: \te…
We consider the link prediction problem in a partially observed network, where the objective is to make predictions in the unobserved portion of the network. Many existing methods reduce link prediction to binary classification problem. However, the dominance of absent links in real world networks makes misclassificati…
Paper generates diverse, readable adversarial texts from scratch.
problem Text classification models are easily fooled by adversarial examples.
method Trained a conditional variational autoencoder (VAE) with adversarial loss and utilized GANs to generate consistent adversarial texts.
result Successfully generates adversarial texts with higher success rate and acceptable quality.
SCROLLS benchmarks long text NLP tasks, improving existing models.
problem Short NLP benchmarks ignore long texts; SCROLLS addresses this.
method Handpicked long-text datasets for summarization, QA, and inference tasks.
result Improvement potential on SCROLLS tasks, as indicated by initial baselines.
New method detects text changes under dependencies, outperforming baselines.
problem Detecting structural changes in -dependent text data.
method Kernel change-point detection under -dependence.
result Consistent and weakly consistent detection of change points in -dependent text.
Contextual bandits study how reward variance affects regret bounds.
problem Investigating how small reward variance impacts regret bounds in contextual bandits.
method Analyzing two types of adversaries and function approximation complexities.
result Regret bounds are influenced by the eluder dimension and reward variance.
The paper studies symplectic structures on character varieties of Sasakian threefolds.
problem Character varieties of Sasakian threefolds and their symplectic structures.
method Constructing a natural algebraic 2-form and showing its properties.
result The restriction of the 2-form to the space of irreducible SU(r) homomorphisms is symplectic.