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 · Jan 202019922001200920172026
34 results for CMIS

Unified framework for proving generalization bounds in machine learning.

problem Proving generalization bounds for machine learning algorithms.
method Conditional mutual information (CMI) framework to express and optimize bounds.
result Unified framework for proving generalization bounds in the realizable setting.

This work analyzes generalization in federated learning using information theory.

problem Generalization performance in federated learning is less explored compared to centralized learning.
method The work applies an information-theoretic analysis via the conditional mutual information (CMI) framework to study federated learning's two-level generalization.
result The work derives multiple CMI-based bounds, including hypothesis-based CMI bounds and fast-rate evaluated CMI bounds, which improve convergence rates for specific model aggregation strategies and structured loss functions.

New bounds using samplewise evaluated CMI for deep neural networks.

problem Improving generalization bounds for deep neural networks.
method Introduced a new family of information-theoretic generalization bounds using samplewise evaluated conditional mutual information (CMI).
result The new bounds can be tighter than previous ones for deep neural networks.

Conditional Mutual Information (CMI) is a measure of conditional dependence between random variables X and Y, given another random variable Z. It can be used to quantify conditional dependence among variables in many data-driven inference problems such as graphical models, causal learning, feature selection and time-se…

2019-06-05abs ↗pdf ↗

New method tests CMI using deep neural networks for high-dimensional data.

problem Testing conditional mean independence in high-dimensional settings.
method Population CMI measure and bootstrap-based testing with deep generative neural networks.
result Strong empirical performance and versatility in various scenarios.

The paper shows that the Gauss map of minimal surfaces is open and meagre in the space of holomorphic maps.

problem Characterizing the set of minimal surfaces with a specific Gauss map.
method Analyzing the spaces of conformal minimal immersions and holomorphic maps, and using topological properties.
result The Gauss map assignment is an open map, and the set of minimal surfaces satisfying the Osserman curvature estimate is meagre.

Paper proposes machine learning models for more accurate road inspection.

problem Traditional road inspection systems have safety, energy, and cost issues.
method Hybrid machine learning models using surface deflection data from FWD tests.
result CMIS model outperforms other models with APRE=2.3303, AAPRE=11.6768, RMSE=12.0056, and SD=0.0210.

New monitoring method detects ML risk models' performance changes in medical interventions.

problem Monitoring ML risk models in healthcare is complicated by confounding medical interventions.
method Developed a new score-based CUSUM monitoring procedure with dynamic control limits.
result Valid inference is possible if conditional exchangeability or time-constant selection bias hold.

This paper surveys a few aspects of the global theory of wave equations. This material is structured around the contents of a minicourse given by the second author during the CMI/ETH Summer School on evolution equations during the Summer of 2008.

2012-10-30abs ↗pdf ↗

Canonical Correlation Analysis (CCA) is a classic technique for multi-view data analysis. To overcome the deficiency of linear correlation in practical multi-view learning tasks, various CCA variants were proposed to capture nonlinear dependency. However, it is non-trivial to have an in-principle understanding of these…

2019-07-04abs ↗pdf ↗

Proposes a new bound on generalization error using conditional mutual information.

problem Improving the generalization error bound in machine learning.
method Combines error decomposition and conditional mutual information techniques.
result New bound is order-wise better than previous ones in a simple Gaussian setting.

Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between the selected features and the class labels is maximized. Despite …

2018-11-29abs ↗pdf ↗

Develops a new framework for analyzing sequential decision-making problems using information theory.

problem Lack of information-theoretic generalization bounds for sequential decision-making problems.
method Introduces a sequential supersample framework that separates learner filtration from proof-side enlargement, controlling the generalization gap by sequential CMI.
result Establishes a sequential CMI that controls the generalization gap in sequential decision-making problems.

We describe an end-to-end real-time S&P futures trading system. Inner-shell stochastic nonlinear dynamic models are developed, and Canonical Momenta Indicators (CMI) are derived from a fitted Lagrangian used by outer-shell trading models dependent on these indicators. Recursive and adaptive optimization using Adaptive …

2000-07-22abs ↗pdf ↗

New method disentangles latent subspaces under correlation shifts.

problem Correlations between factors of variation make disentanglement models less robust.
method Enforces independence between subspaces conditioned on available attributes using adversarial CMI minimization.
result Models are disentangled and robust under correlation shifts, including in weakly supervised settings.

New method uses CDMs to improve CI testing without distributional assumptions.

problem Testing conditional independence when the conditional distribution is unknown.
method Uses conditional diffusion models (CDMs) to approximate XZX|Z and a classifier-based CMI estimator.
result Proposed method performs better than GAN-based CI tests and controls type I and II errors.

CI-GNN uses GNNs to diagnose psychiatric disorders by identifying causally relevant brain regions.

problem Leveraging GNNs for psychiatric diagnosis requires interpretable models to understand decision-making.
method CI-GNN integrates Granger causality into GNNs to identify causally relevant subgraphs.
result CI-GNN provides more reliable and concise explanations of psychiatric diagnoses.

New bounds study class-specific generalization error in machine learning.

problem Existing generalization theories assume uniform class performance, but in practice, classes vary significantly.
method Developed novel information-theoretic bounds using KL divergence and CMI.
result Theoretical bounds accurately capture complex class-generalization error behavior.

Hierarchical Federated Learning bounds generalize using Wasserstein distance.

problem Bounding generalization error in Federated Learning with hierarchical sampling.
method Introduced a hierarchical sampling framework and derived generalization bounds using Wasserstein distance.
result Recover and strictly imply existing CMI bounds for bounded losses.

New method quantifies feature interactions in machine learning models.

problem Capturing high-order interactions and feature contributions in predictive models.
method Information-theoretic approach using Conditional Mutual Information (CMI) via k-NN.
result Accurately recovers feature interactions in synthetic and real-world datasets.

Study shows data heterogeneity affects distributed learning's generalization error.

problem Effect of data heterogeneity on distributed learning performance.
method Established bounds on generalization error using information-theoretic rate-distortion theory.
result Data heterogeneity improves generalization error for distributed learning.

This study proposes an equal-weight portfolio strategy to reduce risk compared to traditional ETFs.

problem Risk of passive ETFs not matching optimal portfolio weights.
method Introduced an equal-weight portfolio strategy to reduce idiosyncratic risk.
result Equal-weight portfolio has lower risk than traditional ETFs, especially during idiosyncratic events.