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

13263851 · Jun 202019922001200920172026
48 results for implicit cohorts

Research aims to ensure fair classification across explicit and implicit sensitive features.

problem Ensuring fairness in machine learning models when sensitive features are not explicitly provided.
method Defined explicit and implicit cohorts, used clustering of embeddings, modified loss function.
result Improved classification parity across explicit and implicit sensitive features.

Cohort effects are important factors in determining the evolution of human mortality for certain countries. Extensions of dynamic mortality models with cohort features have been proposed in the literature to account for these factors under the generalised linear modelling framework. In this paper we approach the proble…

2017-03-24abs ↗pdf ↗

Bayesian model predicts mental health symptoms from IAT data, improving accuracy over D-score.

problem Limited predictive performance of D-score method for mental health assessment.
method Sparse hierarchical Bayesian model leveraging multi-modal data.
result AUCs of 0.73 (E-IAT) and 0.76 (PSY-IAT) in best modality configurations, significant after FDR correction.

Study identifies 1,012 persistent wallet cohorts on Solana pump.fun, showing coordinated buying behavior.

problem Understanding coordinated buying behavior on Solana pump.fun.
method Two-stage detection pipeline: first-buyer-window extraction followed by persistent-cohort surfacing via graph co-occurrence.
result 1,012 persistent wallet cohorts identified, showing systematic co-buying across multiple launches.

Deep neural networks improve sleep stage classification across diverse datasets.

problem Manual sleep scoring is subjective and lacks reliability; automatic systems generalize poorly.
method Developed a deep neural network using 15,684 polysomnography studies from five cohorts.
result Classification accuracy improved with more training data and multiple data sources.

We introduce a variable importance measure to quantify the impact of individual input variables to a black box function. Our measure is based on the Shapley value from cooperative game theory. Many measures of variable importance operate by changing some predictor values with others held fixed, potentially creating unl…

2019-11-01abs ↗pdf ↗

ODVICE augments EHR cohorts using ontology to improve analysis robustness.

problem Limited records in cohorts for rare diseases hamper robust analysis.
method Ontology-driven Monte-Carlo graph spanning algorithm for data augmentation.
result ODVICE augmented cohorts show ~30% improvement in AUC over non-augmented datasets.

Proposes a new model for mortality forecasting considering age groups and cohort effects.

problem Longevity risk due to ageing population.
method Mixed-effects time-series approach with age groups dependency and random cohort effects.
result Remarkable improvements in forecast accuracy compared to the CBD model.

CAT framework improves AI medical screening fairness and reliability.

problem Imbalanced data, varying performance across cohorts, and patient-level inconsistencies in traditional metrics.
method CAT framework introduces patient-level assessment, entropy-based distribution weighting, and cohort-weighted sensitivity and specificity.
result Enhanced predictive reliability, fairness, and interpretability of AI-driven medical screening models.

Treatment recommendations within Clinical Practice Guidelines (CPGs) are largely based on findings from clinical trials and case studies, referred to here as research studies, that are often based on highly selective clinical populations, referred to here as study cohorts. When medical practitioners apply CPG recommend…

2019-07-09abs ↗pdf ↗

Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts

problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios

Advances in molecular "omics'" technologies have motivated new methodology for the integration of multiple sources of high-content biomedical data. However, most statistical methods for integrating multiple data matrices only consider data shared vertically (one cohort on multiple platforms) or horizontally (different …

2019-06-09abs ↗pdf ↗

Transformers simplify modeling of small longitudinal cohort data by reducing parameters and incorporating attention mechanisms.

problem Challenges in modeling longitudinal cohort data due to complex temporal dependencies and large dataset requirements.
method Simplified transformer architecture with attention mechanism, autoregressive model, and kernel-based temporal decay.
result The approach recovers contextual dependencies even with small datasets, identifying temporal patterns in stress and mental health.

Paper develops NN models for diabetes screening using NHANES data.

problem Developing accurate predictive models for diabetes in diverse populations.
method Proposes a neural network framework with survey weights, uncertainty quantification.
result Robust risk score models for diabetes in US population.

This paper shows how to train only the implicit layer of overparameterized implicit neural networks.

problem Understanding how the implicit layer contributes to the training of overparameterized implicit neural networks.
method Restricting training to only the implicit layer and analyzing the generalization error for ReLU-activated networks.
result Global convergence is guaranteed even if only the implicit layer is trained, and gradient flow with proper random initialization can achieve small generalization errors.

Paper studies the theoretical equivalence between implicit and explicit neural networks in high dimensions.

problem Lack of theoretical analysis of implicit and explicit neural networks.
method Examined high-dimensional implicit neural networks and established their equivalence to explicit networks.
result Equivalence between implicit and explicit neural networks in high dimensions.

Gradient matching method estimates implicit regularization in complex deep learning systems.

problem Estimating implicit regularization in modern deep learning systems with complex modifications.
method Gradient matching methods to empirically estimate implicit regularization.
result Empirical estimation of implicit regularization in arbitrary networks, including dropout.

Continuous semi-implicit models enable faster training and better performance in generative modeling.

problem Slow convergence in hierarchical semi-implicit models during training.
method CoSIM, a continuous semi-implicit model that incorporates a continuous transition kernel for efficient training.
result CoSIM achieves superior performance on image generation tasks compared to existing methods.

Gradient descent converges to a global minimum in nonlinear ReLU implicit networks with linear width.

problem Understanding convergence of gradient methods in nonlinear, infinitely deep ReLU networks.
method Introduced a scaling constant to ensure well-posedness of the equilibrium equation, proving convergence to a global minimum for linear width networks.
result Gradient descent converges to a global minimum at a linear rate for nonlinear ReLU implicit networks with linear width.

Study finds implicit government guarantee improves municipal investment bond ratings.

problem Questioning the objectivity of municipal investment bond ratings due to implicit government guarantee.
method Text mining of policy documents and PMC index model for implicit guarantee strength calculation.
result Implicit government guarantee boosts municipal investment bond ratings, especially in less developed regions.

Study shows SGD's generalization is not explained by implicit bias.

problem Explaining the generalization ability of overparameterized learning algorithms.
method Revisited Stochastic Convex Optimization with SGD, demonstrating limitations of implicit bias.
result No distribution-independent or distribution-dependent implicit regularizer can explain SGD's generalization.

This paper measures the intensity of implicit government guarantees using PMC index model.

problem Excessive local government debt due to implicit government guarantees.
method Text mining of policy documents related to municipal investment bonds, PMC index model.
result Recent policies have reduced the intensity of implicit government guarantees.

The paper explains implicit regularization in hierarchical tensor factorization and deep CNNs.

problem Understanding implicit regularization in complex neural network architectures.
method Theoretical analysis using dynamical systems to overcome challenges in hierarchy.
result Established implicit regularization towards low hierarchical tensor rank, equivalent to locality in CNNs.

In this paper, we describe the "implicit autoencoder" (IAE), a generative autoencoder in which both the generative path and the recognition path are parametrized by implicit distributions. We use two generative adversarial networks to define the reconstruction and the regularization cost functions of the implicit autoe…

2018-05-24abs ↗pdf ↗

Deep tensor factorization benefits from implicit regularization with polynomial growth.

problem Tensor factorization's implicit regularization effect in deep networks is not well understood.
method Investigated the implicit regularization in deep tensor factorization, showing polynomial growth.
result Implicit regularization in deep tensor factorization grows polynomially with depth, improving estimation accuracy and convergence.

Gradient descent on ReLU networks with square loss implicitly favors balanced weights.

problem Understanding implicit regularization in nonlinear neural networks with regression losses.
method Analyzing gradient descent dynamics on ReLU networks with square loss.
result It is impossible to characterize the implicit regularization of ReLU networks with square loss by any explicit function of model parameters.

We extend the existing framework of semi-implicit variational inference (SIVI) and introduce doubly semi-implicit variational inference (DSIVI), a way to perform variational inference and learning when both the approximate posterior and the prior distribution are semi-implicit. In other words, DSIVI performs inference …

2018-10-05abs ↗pdf ↗