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

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199419922001200920172026
48 results for interactive guidelines

This study explores how feature graphs enhance GNNs' performance in modeling interactions.

problem Improving GNNs' ability to model feature interactions effectively.
method Investigates feature graphs and their importance in GNNs, using experiments and theoretical support.
result Edges between interacting features are crucial for GNNs, while non-interaction edges can degrade performance.

Survival analysis models predict economic convergence across Americas.

problem Analyzing GDP per capita trajectories and convergence across the Americas.
method Survival analysis, machine learning, economic interpretation.
result DeepSurv captures non-linear interactions in GDP per capita trajectories.

Current advances in research, development and application of artificial intelligence (AI) systems have yielded a far-reaching discourse on AI ethics. In consequence, a number of ethics guidelines have been released in recent years. These guidelines comprise normative principles and recommendations aimed to harness the …

2019-02-28abs ↗pdf ↗

Deviance Voronoi residuals improve earthquake insurance risk assessment.

problem Assessing earthquake insurance risk using spatio-temporal point process models.
method Extended Voronoi residuals and created simulation-based approach.
result Proposed formula for country-wide minimum capital test.

Framework for applying GPs to real-world data with scalability guidelines.

problem Deployment of Gaussian Processes (GPs) is hindered by computational costs and lack of guidelines.
method Proposed a framework for identifying GP suitability and setting up robust models, formalizing decisions of experienced practitioners.
result More accurate results at test time for glacier elevation change case study.

Paper benchmarks mutual info estimators on diverse distributions.

problem Evaluating mutual information estimators on complex, real-world distributions.
method Constructs a diverse family of known-ground truth distributions, proposes a benchmark platform.
result Highlights differences in classical and neural estimators' performance across various conditions.

Restricted Boltzmann machines~(RBMs) and conditional RBMs~(CRBMs) are popular models for a wide range of applications. In previous work, learning on such models has been dominated by contrastive divergence~(CD) and its variants. Belief propagation~(BP) algorithms are believed to be slow for structured prediction on con…

2017-03-02abs ↗pdf ↗

Paper derives policy rules from observational data for hepatitis C treatment.

problem Improving treatment guidelines for HIV/HCV co-infected patients.
method Weighted K-means algorithm for estimating CATEs, decision tree implementation.
result Identifies a subgroup with high spontaneous HCV clearance rate.

The goal of this article is to inspire data scientists to participate in the debate on the impact that their professional work has on society, and to become active in public debates on the digital world as data science professionals. How do ethical principles (e.g., fairness, justice, beneficence, and non-maleficence) …

2019-01-14abs ↗pdf ↗

Scale of data and scale of computation infrastructures together enable the current deep learning renaissance. However, training large-scale deep architectures demands both algorithmic improvement and careful system configuration. In this paper, we focus on employing the system approach to speed up large-scale training.…

2017-08-10abs ↗pdf ↗

Deep neural networks (DNNs) have been proven to have many redundancies. Hence, many efforts have been made to compress DNNs. However, the existing model compression methods treat all the input samples equally while ignoring the fact that the difficulties of various input samples being correctly classified are different…

2018-07-04abs ↗pdf ↗

Sherpa.ai framework combines federated learning and differential privacy for edge AI services.

problem Protecting data privacy in edge AI services.
method Holistic federated learning and differential privacy approach with methodological guidelines.
result Demonstrated through classification and regression use cases.

Paper addresses theoretical risks in neural MCCFR, proposing Robust Deep MCCFR for improved performance.

problem Theoretical risks in neural MCCFR, especially in large games.
method Adaptive framework with selective component deployment, including target networks, exploration, and variance-aware training.
result Robust Deep MCCFR achieves significant exploitability improvements in both Kuhn and Leduc Poker.

State-of-the-art machine learning frameworks support a wide variety of design features to enable a flexible machine learning programming interface and to ease the programmability burden on machine learning developers. Identifying and using a performance-optimal setting in feature-rich frameworks, however, involves a no…

2019-08-13abs ↗pdf ↗

This chapter introduces reproducibility in machine learning for medical imaging.

problem Lack of reproducibility in machine learning for medical imaging.
method Distinguishes and defines types of reproducibility, outlines requirements, and discusses utility.
result Discussion on benefits and a plea for a non-dogmatic approach to reproducibility.

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.

The paper analyzes SMOTE for imbalanced classification, providing theoretical bounds and guidelines.

problem The challenge of imbalanced classification problems, especially with minority classes.
method Theoretical analysis of SMOTE and related oversampling techniques for minority classes.
result Derives concentration and excess risk bounds for SMOTE and kernel-based classifiers.

Robust low-rank matrix estimation is a topic of increasing interest, with promising applications in a variety of fields, from computer vision to data mining and recommender systems. Recent theoretical results establish the ability of such data models to recover the true underlying low-rank matrix when a large portion o…

2011-09-28abs ↗pdf ↗

New analysis reveals batch size effects on stochastic conditional gradient methods.

problem Understanding the role of batch size in stochastic conditional gradient methods.
method Deriving a new analysis focusing on momentum-based stochastic conditional gradient algorithms (e.g., Scion).
result Increasing batch size initially improves optimization accuracy but can degrade performance beyond a critical threshold.

The paper provides guidelines for choosing between SBI methods in complex biological models.

problem Choosing appropriate SBI methods for real-world biological data.
method Comprehensive guidelines and application to agent-based models.
result Statistical SBI methods outperform neural SBI methods with sufficient computational resources.

The study examines how experimental design choices affect machine learning model performance.

problem Lack of guidelines on choosing experimental designs and machine learning models.
method 12 experimental designs, 7 families of predictive models, 7 test functions, 8 noise settings.
result Guidelines for practical applications of DOE and ML are provided.

Develops variational Bayesian neural network for complex biomedical applications.

problem High computational cost of Markov Chain Monte Carlo in BNN.
method Variational Bayes inference for posterior consistency and classification accuracy.
result Developed statistical theory for posterior consistency and prediction accuracy.

Improves interpretability of anomaly scores in GBRBM-based detection.

problem Difficulty in setting a proper threshold for anomaly scores.
method Proposes a measure based on cumulative distribution and uses simulated annealing for evaluation.
result Established a guideline for setting the threshold using the interpretable measure.

Approximate Incremental Value-at-Risk formulae provide an easy-to-use preliminary guideline for risk allocation. Both the cases of risk adding and risk pooling are examined and beta-based formulae achieved. Results highlight how much the conditions for adding new risky positions are stronger than those required for ris…

2002-04-28abs ↗pdf ↗

New tuning rules for Metropolis algorithms derived from Bayesian large-sample asymptotics.

problem Optimal scaling in random-walk Metropolis algorithms under realistic assumptions.
method Large-sample asymptotics to derive weak convergence results and tuning guidelines.
result Tuning guidelines consistent with previous ones when target density is product form, accounting for correlation structure.

New method reduces indirect discrimination in insurance risk models.

problem Indirect discrimination in insurance risk models using machine learning.
method Mathematical concepts of linear algebra to reduce indirect discrimination.
result Demonstrated promising performance in a concrete case of risk selection in life insurance.

Self-attention models benefit equally from width and depth, but beyond a certain point, depth becomes less efficient.

problem Understanding the optimal balance between depth and width in self-attention models.
method Theoretical predictions and empirical ablations on networks of varying depths and widths.
result An optimal width of 30K is recommended for a 1-Trillion parameter network, marking a significant width for self-attention models.