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

4.2%8.3%12.5%16.7% · Sep 199519922001200920172026
48 results for reviewer scores

ScoreGAN uses GANs with IGM to detect bot-generated reviews based on text and scores.

problem Lack of labeled data and bot-generated reviews in fraud review detection.
method ScoreGAN incorporates review text and scores into a GAN framework for data augmentation and detection.
result ScoreGAN outperforms existing methods by 7% and 5% on Yelp and TripAdvisor datasets.

Our study employs sentiment analysis to evaluate the compatibility of Amazon.com reviews with their corresponding ratings. Sentiment analysis is the task of identifying and classifying the sentiment expressed in a piece of text as being positive or negative. On e-commerce websites such as Amazon.com, consumers can subm…

2019-04-04abs ↗pdf ↗

The article reviews scoring rules for estimating and evaluating forecasts.

problem Evaluating probabilistic forecasts and estimating probability distributions.
method Mathematical foundations and characterization of scoring rules.
result Important families of scoring rules and their applications in statistics and machine learning.

We consider the problem of automated assignment of papers to reviewers in conference peer review, with a focus on fairness and statistical accuracy. Our fairness objective is to maximize the review quality of the most disadvantaged paper, in contrast to the commonly used objective of maximizing the total quality over a…

2018-06-16abs ↗pdf ↗

This review covers predictive uncertainty estimation in machine learning.

problem Improving the communication of uncertainty in machine learning predictions.
method A comprehensive review of probabilistic prediction methods from early statistical models to recent machine learning algorithms.
result The review highlights the importance of consistent scoring functions and proper scoring rules for assessing probabilistic predictions.

Diffusion models enhance SBI with flexible parameter and observation learning.

problem Efficient and accurate estimation of latent parameters from simulations and real data.
method Score-based diffusion models, guidance, score composition, flow matching, consistency models, joint modeling.
result Flexibility and versatility in modeling various problems.

This study analyzes app reviews to understand students' behavior in the app market.

problem Extracting sentiment from growing app reviews manually is impractical.
method Used machine learning algorithms with TF-IDF for text representation and ensemble learning for evaluation.
result SVM achieved the highest accuracy (93.37%) on tri-gram + TF-IDF scheme.

This review examines deep learning in financial fraud detection over 5 years.

problem Improving deep learning techniques for financial fraud detection.
method Systematic literature review of 57 studies using performance metrics.
result Deep learning models enhance fraud detection across various financial domains.

The paper reviews methods for determining the number of communities in network data.

problem Determining the number of communities in network data.
method Statistical methods for hypothesis testing and clustering in network models.
result SCORE and NCV methods evaluated for clustering in Degree-Corrected Block Models, with NCV facing challenges.

The study examines causal razors and their logical relations, highlighting a dilemma in causal discovery.

problem Selecting a reasonable scoring criterion for causal discovery algorithms.
method Review and logical comparison of numerous causal razors, focusing on parameter minimality in multinomial models.
result Parameter minimality poses a dilemma in selecting a reasonable scoring criterion for causal discovery algorithms.

Algorithm reduces audit costs by identifying best service configurations from biased textual evidence.

problem Designing service systems from textual evidence requires accurate selection despite biased automated scoring.
method Developed PP-LUCB algorithm combining LLM scores and selective audits to minimize costs.
result Correctly identified the best model in 40/40 trials with 90% cost reduction.

Critiques binary classification evaluation methods, advocating for proper scoring rules.

problem The dominance of top-K metrics and fixed-threshold evaluations in machine learning.
method Introduces a decision-theoretic framework mapping evaluation metrics to their use cases, and implements a clipped Brier score variant.
result Demonstrates the clinical utility of proper scoring rules through a Python package, exttt{briertools}.

Systematic review of ML models for detecting social media deception.

problem Detecting fake news, spam, and fake accounts on social media.
method 36 studies evaluated using PROBAST tool, identifying biases and limitations.
result Over-reliance on accuracy in imbalanced data settings is a flaw.

Generative models need per-sample confidence scores to improve quality and stability.

problem Generative models produce unreliable outputs and lack confidence measures.
method Flow Matching with Confidence (FMwC) injects noise and integrates it through the network, providing per-sample confidence scores.
result The confidence score correlates with the velocity field's divergence, offering insights into generative processes.

A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit computationally convenient factorization properties and have long been a valuable tool for t…

2016-06-07abs ↗pdf ↗

AIMM-X monitors markets for suspicious behavior using transparent scoring.

problem Detecting market manipulation from benign mechanisms.
method Combines microstructure signals and public attention signals for anomaly detection.
result Transparent scoring allows tracing and understanding flagged windows.

This paper enhances uplift modeling for multi-treatment marketing campaigns.

problem Optimizing marketing strategies by selecting individuals likely to respond to different treatments.
method Leveraging score ranking and calibration techniques.
result Improves overall performance of marketing campaigns.

This dissertation uses ILP to learn Bayesian network structures efficiently.

problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.

Score matching fails to train VAEs robustly, revealing autoencoding loss insights.

problem Catastrophic failure of variational score matching on VAE models.
method Analysis of existing variational score matching objectives and their equivalence to autoencoding losses.
result Score matching methods fail to produce robust VAE models, predicting poor performance.

Two machine learning models detect anomalies in ER claims, saving up to 40% in improper payments.

problem Improper health insurance payments from fraud and upcoding.
method Two machine learning models: an upcoding model based on severity code distributions and a random forest model for claim sorting.
result Random forest model saved 12% to 40% in improper payments compared to a baseline approach.

We review different approaches for measuring the impact of liquidity on CDS prices. We start with reduced form models incorporating liquidity as an additional discount rate. We review Chen, Fabozzi and Sverdlove (2008) and Buhler and Trapp (2006, 2008), adopting different assumptions on how liquidity rates enter the CD…

2010-03-03abs ↗pdf ↗

LLmFPCA-detect detects anomalies in sparse longitudinal text data using LLMs and mFPCA.

problem Challenges in detecting patterns and anomalies in sparse longitudinal textual data.
method Pairs LLM-based text embeddings with mFPCA to detect clusters and anomalies.
result LLmFPCA-detect outperforms state-of-the-art baselines on Amazon and Wikipedia datasets.

This paper argues against using calibration metrics for assessing posterior probabilities and proposes expected proper scoring rules instead.

problem The assessment of posterior probabilities generated by machine learning classifiers using calibration metrics is flawed and should be replaced with expected proper scoring rules.
method The paper reviews proper scoring rules from a practical perspective, explains why expected PSRs are a principled measure of posterior quality, and introduces a new calibration metric called calibration loss.
result Calibration loss is superior to expected calibration error and expected score divergence calibration metrics for assessing posterior probabilities.

New method uses information bottleneck to quantify variable importance in neural networks.

problem Quantifying the importance of individual input variables in neural networks.
method Restricting the flow of information by adding noise to intermediate feature maps.
result Our method outperforms all baselines in five out of six settings.

This work proposes using zero-variance control variates to reduce variance in pathwise gradient estimators for variational inference.

problem Pathwise gradient estimators in variational inference have high variance, leading to inefficient optimization.
method Apply zero-variance control variates to pathwise gradient estimators.
result Zero-variance control variates can significantly reduce the variance of pathwise gradient estimators without requiring complex assumptions.

There are three quite distinct ways to train a machine learning model on recommender system logs. The first method is to model the reward prediction for each possible recommendation to the user, at the scoring time the best recommendation is found by computing an argmax over the personalized recommendations. This metho…

2019-04-24abs ↗pdf ↗

Automated scoring prioritizes risky driving behavior in telematic auto insurance policies.

problem Identifying risky driving behavior in telematic auto insurance policies using machine learning.
method Bayesian approach using MCMC to model propensity of policyholders to undertake trips resulting in positive classification.
result The approach improves efficiency of human resource allocation in identifying risky driving behavior.

FST.ai 2.0 improves Taekwondo decision-making with AI, reducing review time and increasing trust.

problem Fair, transparent, and explainable decision-making in Taekwondo.
method Pose-based action recognition, epistemic uncertainty modeling, interactive dashboards.
result 85% reduction in decision review time, 93% referee trust in AI-assisted decisions.

Framework for precise recall control in spatial conflation tasks.

problem Precise recall control in large-scale spatial conflation tasks to avoid downstream analytics failures and excessive manual review.
method End-to-end framework using equigrid bounding-box filter, CSR representation, neural ranker, and inverse-variance weighted ensemble of threshold estimators.
result Achieves exact recall with sub-percent variance over tens of millions of geometry pairs, runs on a single TPU v3 core.

The paper uses geometry to assess how hard examples are for NLP models.

problem Challenges in NLP datasets and classifiers, especially with shallow features.
method Information geometry to quantify example difficulty, exploring BERT, CNN, and fasttext.
result Deep learning models are vulnerable to word substitutions in difficult examples.

Online reviews provided by consumers are a valuable asset for e-Commerce platforms, influencing potential consumers in making purchasing decisions. However, these reviews are of varying quality, with the useful ones buried deep within a heap of non-informative reviews. In this work, we attempt to automatically identify…

2017-05-06abs ↗pdf ↗

Peer review is the foundation of scientific publication, and the task of reviewing has long been seen as a cornerstone of professional service. However, the massive growth in the field of machine learning has put this community benefit under stress, threatening both the sustainability of an effective review process and…

2018-12-18abs ↗pdf ↗

Unsupervised summarization generates novel reviews reflecting consensus opinions.

problem Creating summaries that reflect subjective information in multiple documents.
method Generative model with hierarchical variational autoencoder, pointer-generator mechanism.
result Model produces fluent and coherent summaries reflecting common opinions.