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.

169,181 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920182026
48 results for crime distribution

Model predicts crime distribution in real-time, superior to existing methods.

problem Accurate real-time crime forecasting is difficult due to sparse and weak historical data.
method Adapted spatial temporal residual network to predict crime distribution in Los Angeles.
result The proposed model outperforms existing approaches in crime prediction accuracy.

CRIMED optimizes regret in bandits with unbounded stochastic corruption.

problem Minimizing regret in bandits with arbitrary unbounded corruptions.
method Introduces CRIMED, an asymptotically-optimal algorithm for Gaussian distributions with known variance.
result Achieves exact lower bound on regret for Gaussian distributions with high corruption probability.

Predictive policing models can be biased by differential crime reporting rates.

problem Bias in predictive policing models due to differential crime reporting.
method Simulation based on Bogotá, Colombia's victimization and crime reporting data.
result Differential crime reporting rates can lead to misallocation of police patrols.

The paper introduces a US crime index to assess financial losses from property and cyber crimes.

problem Lack of indices evaluating crime's financial impact on investments.
method Developed an index-based insurance portfolio using FBI financial losses data.
result Real estate, ransomware, and government impersonation are major risk contributors.

Paper aims to use AI for detecting financial crimes, focusing on money laundering.

problem Financial institutions need better technologies to detect and predict financial crimes.
method Study recent works, develop a novel model for money laundering detection.
result Demonstrates a model for detecting money laundering cases with minimal human intervention.

Runaway feedback loops in predictive policing cause crime rate disparities.

problem Runaway feedback loops in predictive policing systems exacerbate crime rate disparities.
method Developed a mathematical model to explain and demonstrate interventions to prevent runaway feedback loops.
result Interventions can prevent runaway feedback loops and allow true crime rates to be learned.

The study improves crime prediction using Foursquare and streetlight data with demographic info.

problem Improving crime prediction models using diverse data sources.
method Combining Foursquare and streetlight data with demographic info for crime prediction.
result The proposed model enhances classification performance in crime prediction.

New approach predicts crime and terrorism events with high accuracy and transparency.

problem Predicting crime and terrorism events with high accuracy and interpretability.
method Granger Network inference for local transport rules learning.
result Achieved AUC of ~90% for crime predictions and ~80% for terrorism predictions.

Paper proposes a federated graph learning platform to improve financial crime detection.

problem Current financial crime detection methods are ineffective and costly.
method Federated graph learning platform combining federated learning and graph learning.
result Federated model outperforms local model by 20%.

Method predicts crime hotspots with high resolution.

problem Forecasting sparse spatiotemporal events like crime.
method Combines RKHS methods with autoregressive smoothing kernels.
result Significantly outperforms baseline models for sparse events.

Paper explores how unsupervised learning reduces financial crime risks.

problem Identifying high-risk financial groups from complex data.
method Combines clustering and dimensionality reduction techniques.
result KPCA outperforms other techniques in reducing financial crime risks.

Nested model averaging improves high-dimensional linear regression performance.

problem High-dimensional linear regression with predictor ordering impact.
method Combining model averaging with regularized estimators on the solution path.
result Nested model averaging with lasso and SLOPE outperforms competing methods.

New model helps identify suspect footwear from crime scene prints.

problem Identifying a suspect's footwear from crime scene prints among thousands of similar shoes.
method Developed a hierarchical Bayesian model with spatially varying coefficients.
result Improved accuracy and reliability in forensic shoe print analysis.

New method for robust PCA with exponential family distributions.

problem Recovering low-rank structure from data matrices with outliers.
method Alternating Direction Method of Multipliers for eextRPCAe^{ ext{RPCA}}.
result Demonstrated effectiveness in steel sheet defect detection and crime activity monitoring.

This thesis evaluates the quality of binary classification models in crime forecasting tools.

problem Quality assessment of binary classification models in crime forecasting tools.
method Binary classifier approach to evaluate AUCAUC and PPVkPPV_k.
result The PPVkPPV_k deviates significantly from AUCAUC in crime forecasting models.

Paper proposes SOTL framework for improving transfer learning accuracy and efficiency.

problem Statistical bias and computational efficiency in multi-source domain adaptation.
method Sparse Optimization for Transfer Learning (SOTL) with L0-regularization.
result SOTL significantly improves estimation accuracy and computational speed, especially under adversarial conditions.

We propose an efficient method for estimating covariate effects in doubly-stochastic spatial models.

problem Computational demands and restrictive assumptions in existing doubly-stochastic spatial models.
method Penalized regression method for estimating covariate effects in doubly-stochastic point processes.
result Consistency and asymptotic normality of the covariate effect estimates achieved despite model misspecification.

Paper develops a non-parametric model to estimate influence networks in high-dimensional time series.

problem Estimating influence networks in high-dimensional time series with many variables.
method Non-parametric sparse additive model (SpAM) using β and φ-mixing properties of Markov chains and empirical process techniques for RKHSs.
result Sharp upper bounds on mean-squared error for estimating influence networks.

New framework models time-uncertain point processes for better event prediction.

problem Uncertainty in event times in point processes.
method Formulated and discretized continuous-time Hawkes processes with time grid, enabling optimization methods for inference.
result Parameter recovery with O(1/k)O(1/k) convergence rate using gradient descent and VI.

The paper proposes a machine learning framework for detecting DeFi fraud across multiple blockchain chains.

problem Early detection of financial crimes in decentralized finance (DeFi) ecosystems.
method Extracting features from different blockchain chains, employing XGBoost and Neural Network for fraud detection.
result Introduction of novel DeFi-related features significantly improves fraud detection accuracy.

BayesBag improves reproducibility of Bayesian inference under model misspecification.

problem Bayesian posteriors can be unreliable and inconsistent under model misspecification.
method Apply bagging to the Bayesian posterior to improve reproducibility.
result Bagged posteriors typically satisfy reproducibility criteria under misspecification.

Understanding cities is central to addressing major global challenges from climate and health to economic resilience. Although increasingly perceived as fundamental socio-economic units, the detailed fabric of urban economic activities is only now accessible to comprehensive analyses with the availability of large data…

2014-05-13abs ↗pdf ↗

New algorithm predicts spatio-temporal events with improved accuracy.

problem Non-stationary spatio-temporal prediction on dense and sparse sequences.
method Probabilistic approach using point processes and self-organizing decision trees.
result Significant performance improvements over baseline and state-of-the-art methods.