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

2585157731,030 · Jun 202019922001200920172026
48 results for new issues

Proposes a new approach to regression learning that addresses overfitting and underfitting.

problem Regression learning issues, including overfitting and underfitting.
method Introduces epsilon-Confidence Approximately Correct (epsilon CoAC) framework using Kullback Leibler divergence.
result Demonstrates improved learnability and accuracy compared to cross-validation.

The adaptive moment estimation algorithm Adam (Kingma and Ba) is a popular optimizer in the training of deep neural networks. However, Reddi et al. have recently shown that the convergence proof of Adam is problematic and proposed a variant of Adam called AMSGrad as a fix. In this paper, we show that the convergence pr…

2019-04-07abs ↗pdf ↗

New active learning method uses combinatorial coverage to improve data transfer and reduce bias.

problem Inability to transfer sampled data to new models and sampling bias issues.
method Data-centric active learning methods utilizing combinatorial coverage.
result Sampling data with coverage leads to better data transfer and competitive sampling bias.

New issue found in value-based reinforcement learning for stochastic environments.

problem Value-based reinforcement learning struggles with stochastic state transitions.
method Demonstrated using a multiobjective Markov Decision Process (MOMDP).
result Approaches may converge to Pareto-dominated solutions instead of optimal ones.

Notions of "fair classification" that have arisen in computer science generally revolve around equalizing certain statistics across protected groups. This approach has been criticized as ignoring societal issues, including how errors can hurt certain groups disproportionately. We pose a modification of one of the fairn…

2018-06-24abs ↗pdf ↗

PCA is a classical statistical technique whose simplicity and maturity has seen it find widespread use as an anomaly detection technique. However, it is limited in this regard by being sensitive to gross perturbations of the input, and by seeking a linear subspace that captures normal behaviour. The first issue has bee…

2017-04-22abs ↗pdf ↗

GraphFL tackles semi-supervised node classification on graphs using federated learning.

problem Real-world graph-based problems often require collecting the entire graph and labeling a reasonable number of labels, which is impractical and costly.
method GraphFL is a federated learning framework that addresses non-IID data, new label domains, and unlabeled data issues in graph-based semi-supervised node classification.
result GraphFL significantly outperforms compared FL baselines and self-training methods.

Although there are millions of transgender people in the world, a lack of information exists about their health issues. This issue has consequences for the medical field, which only has a nascent understanding of how to identify and meet this population's health-related needs. Social media sites like Twitter provide ne…

2018-08-18abs ↗pdf ↗

Federated learning poses new statistical and systems challenges in training machine learning models over distributed networks of devices. In this work, we show that multi-task learning is naturally suited to handle the statistical challenges of this setting, and propose a novel systems-aware optimization method, MOCHA,…

2017-05-30abs ↗pdf ↗

We address feature interpretation and reproducibility issues in dense nets, proposing a modified loss function.

problem Feature interpretation and reproducibility issues in dense nets.
method Proposed a modified loss function to circumvent basis collapse.
result Substantially concise nets with 100x fewer parameters and lower MSE loss.

Machine learning improves RNA secondary structure prediction.

problem Stagnant performance of RNA secondary structure prediction methods.
method Machine learning, especially deep learning, is used to predict RNA secondary structures.
result Machine learning methods have improved the prediction of RNA secondary structures.

New method offsets DML's error-compounding issue and provides more stable causal parameter estimates.

problem Estimating ATE from observational data with robustness and stability.
method Robust Causal Learning (RCL) method to offset DML's deficiencies.
result RCL estimators are more stable and perform better than DML and traditional estimators.

New method compresses large sample data for faster discriminant analysis.

problem Large sample sizes in discriminant analysis increase computational burden.
method Proposes a new compression approach for reducing training samples.
result Significant computational gains and superior predictive ability compared to random sub-sampling.

The paper proves existence and growth estimates for inverse mean curvature flow and related pp-Laplacian Green kernel decay.

problem Existence and growth estimates for inverse mean curvature flow.
method Proving new decay estimates for the Green kernel of the pp-Laplacian.
result Existence and optimal growth estimates for the weak inverse mean curvature flow.

This paper surveys recent progress on issues related to the Bartnik quasi-local mass mBm_B. In addition, we formulate a number of new problems and conjectures regarding foundational properties of the mass mBm_B. This work is dedicated with pleasure to Robert Bartnik in honor of his 60th birthday.

2019-03-09abs ↗pdf ↗

New approach to deeper graph neural networks to avoid performance degradation.

problem Performance degradation of graph neural networks when going deeper.
method Decoupling representation transformation and propagation in graph convolution operations.
result Deeper graph neural networks can be used to learn graph node representations from larger receptive fields.

New approach to optimal income tax theory tackles inequity issues.

problem Optimal tax schedules often lead to minimal tax rates for higher earners, contradicting ethical practices.
method Developed a theorem for piecewise-linear environment and introduced a new utility function parameter.
result New approach leads to more equitable tax schedules, interpreting optimality criteria easily.

A new framework ensures model safety by retaining old model capabilities while improving new tasks.

problem Catastrophic forgetting in continual learning systems.
method Retention-centric framework with data-dependent constraints and an efficient constrained optimization algorithm.
result The method ensures that new models retain important capabilities of old models while improving new tasks.

This foreword discusses the contributions of Bolyai, Gauss, and Lobachevsky to non-Euclidean geometry.

problem The development of non-Euclidean geometries by Bolyai, Gauss, and Lobachevsky.
method Historical review of the contributions of these mathematicians.
result The foundational work on non-Euclidean geometries by Bolyai, Gauss, and Lobachevsky.

Investigates numerical issues in GP interpolation parameter estimation.

problem Numerical issues in maximum likelihood parameter estimation for Gaussian process interpolation.
method Investigates and proposes strategies to improve open-source software implementations.
result Improves reliability and reproducibility of studies relying on GP implementations.

This paper tackles ranking-based performance normalization for optimization algorithms.

problem Ranking optimization algorithms across diverse numerical scales disrupts performance comparisons.
method Introduces absolute ranking and a sampling-based computational method to address numerical scale variation.
result Provides a more robust framework for assessing performance across multiple algorithms and problems.

New method extracts aleatoric and epistemic uncertainties from regression-based neural networks.

problem Need for principled uncertainty reasoning in machine learning systems.
method Learning evidential distributions for aleatoric and epistemic uncertainties.
result Allows for the simultaneous extraction of both uncertainties without sampling or out-of-distribution data.

Score-based methods fail with isolated components and incorrect mixing proportions.

problem Score-based methods struggle with distributions having isolated components and incorrect mixing proportions.
method Score-based methods, including score matching, are used but fail in the presence of isolated components and incorrect mixing proportions.
result Score-based methods cannot discover isolated components or identify correct mixing proportions.