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

1122 · Feb 202019922001200920172026
18 results for CGM

The Collective Graphical Model (CGM) models a population of independent and identically distributed individuals when only collective statistics (i.e., counts of individuals) are observed. Exact inference in CGMs is intractable, and previous work has explored Markov Chain Monte Carlo (MCMC) and MAP approximations for le…

2014-05-20abs ↗pdf ↗

Generative AI can solve in-context learning problems using a martingale perspective.

problem Estimating when a conditional generative model can solve an in-context learning problem.
method Bayesian interpretation, ancestral sampling, generative predictive p-value.
result Developed a method to assess the suitability of CGMs for ICL problems using generative predictive p-values.

Paper estimates AI hallucinations in conditional generation tasks.

problem Estimating the frequency of AI-generated incorrect responses.
method Developed a method to estimate hallucination probability from generated responses and log probabilities.
result Method accurately estimates hallucination rate in natural language and synthetic tasks.

New method improves MAP inference for CGMs on path graphs, avoiding approximation and maintaining integrality.

problem Improving MAP inference for aggregated count data in CGMs with small values.
method Formulated as a minimum cost flow problem, solved using DCA with efficient subroutines.
result Outputs higher quality solutions than conventional methods.

CGM combines SSL and LFM for better recommendation performance.

problem Label sparsity in user-item rating matrices limits LFM performance.
method Probabilistic chain graph model (CGM) integrating Bayesian network and Markov random field.
result CGM significantly outperforms state-of-the-art approaches in recommendation.

New framework predicts 5-year glucose values with missing data.

problem Significant missing data in longitudinal glucose studies.
method Reproducing Kernel Hilbert Spaces (RKHS) with missing responses analysis.
result Identifies new factors affecting long-term glucose evolution.

A method models continuous-time glucose distributions in children with diabetes.

problem Capturing subtle temporal changes in glucose distributions.
method Probabilistic framework using Gaussian mixtures and neural ODEs.
result Detects treatment-related improvements in glucose dynamics.

Study finds RNNs predict STBG better than ARIMA, useful for diabetes patients.

problem Improving short-term blood glucose prediction for diabetes management.
method Investigated Recurrent Neural Networks (RNNs) and compared them to ARIMA for STBG prediction.
result Population-based RNN model outperforms ARIMA across various prediction horizons.

Hybrid model learns interpretable meal-level glycemic control.

problem Lack of flexible, interpretable meal-level glycemic control methods.
method Hybrid variational autoencoder grounding latent space to mechanistic differential equation.
result Unsupervised representation discovers separation between individuals based on disease severity.

A new probabilistic framework for optimal transport using collective graphical models.

problem Measuring similarity between probability distributions and histograms.
method Probabilistic Optimal Transport based on Collective Graphical Models.
result OT with entropic regularization is equivalent to maximizing a posterior probability of a CGM.

We present sufficient conditions for the cohomology of a closed aspherical manifold to be proper Lipschitz in sense of Connes-Gromov-Moscovici [CGM]. The conditions are stated in terms of the Stone-Čech compactification of the universal cover of a manifold. We show that these conditions are formally weaker than the suf…

2002-05-15abs ↗pdf ↗

Modeling glucose distribution changes over time using neural ODEs.

problem Analyzing how continuous glucose distribution changes over time in diabetic patients.
method Combines Gaussian mixture, MMD, and Neural ODE to model temporal evolution of glucose distribution.
result Highly interpretable model detects subtle distribution shifts and remains computationally efficient.

A new method solves variational inequality problems with multiple constraints without needing optimal Lagrange multipliers.

problem Solving variational inequality problems with multiple functional constraints efficiently.
method Constrained Gradient Method (CGM) for Minty variational inequality problems.
result The Constrained Gradient Method achieves complexity similar to projection-based methods but with cheaper oracles.

With the increasing availability of wearable devices, continuous monitoring of individuals' physiological and behavioral patterns has become significantly more accessible. Access to these continuous patterns about individuals' statuses offers an unprecedented opportunity for studying complex diseases and health conditi…

2019-07-29abs ↗pdf ↗