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

Trend · papers per month

18375573 · Jun 202019922001200920172026
48 results for mutual affinity

Proposes VCLANC for attributed network clustering using node and attribute embeddings.

problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.

Smooth manifolds have been always understood intuitively as spaces with an affine geometry on the infinitesimal scale. In Synthetic Differential Geometry this can be made precise by showing that a smooth manifold carries a natural structure of an infinitesimally affine space. This structure is comprised of two pieces o…

2018-09-16abs ↗pdf ↗

On the probability simplex, we can consider the standard information geometric structure with the e- and m-affine connections mutually dual with respect to the Fisher metric. The geometry naturally defines submanifolds simultaneously autoparallel for the both affine connections, which we call {\em doubly autoparallel s…

2017-11-30abs ↗pdf ↗

Deep nonlinear models pose a challenge for fitting parameters due to lack of knowledge of the hidden layer and the potentially non-affine relation of the initial and observed layers. In the present work we investigate the use of information theoretic measures such as mutual information and Kullback-Leibler (KL) diverge…

2016-12-17abs ↗pdf ↗

An affine manifold is a manifold with torsion-free flat affine connection. A geometric topologist's definition of an affine manifold is a manifold with an atlas of charts to the affine space with affine transition functions; a radiant affine manifold is an affine manifold with holonomy consisting of affine transformati…

1997-12-19abs ↗pdf ↗

Various results based on some convexity assumptions (involving the exponential map along with affine maps, geodesics and convex hulls) have been recently established on Hadamard manifolds. In this paper we prove that these conditions are mutually equivalent and they hold if and only if the Hadamard manifold is isometri…

2014-08-04abs ↗pdf ↗

New findings on neural network identifiability using affine symmetries.

problem Identifying all neural networks that produce a given function.
method Examined affine symmetries of nonlinearities and their impact on neural network identifiability.
result Symmetries can be used to find a rich set of networks giving rise to the same function, except for a special case.

Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.

problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.

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.

Study of polynomial almost-complex curves in a specific space.

problem Understanding polynomial almost-complex curves in a particular geometric space.
method Analyzing solutions to the g2 affine Toda field equations with polynomial holomorphic sextic differentials.
result The asymptotic boundary of the curves forms a polygon with an annihilator property related to a G2' invariant metric.

Improved bounds on learning algorithms' performance using conditional mutual information.

problem Bounding the generalization error of learning algorithms.
method Introducing conditional mutual information and disintegrated mutual information to tighten bounds.
result New bounds are tighter than previous ones, especially for noisy, iterative algorithms.

The paper argues that normalized mutual information is biased in clustering and community detection.

problem Bias in normalized mutual information for clustering and community detection.
method Introducing a modified version of mutual information to correct for information content and spurious dependence.
result The modified mutual information leads to different conclusions about which algorithms are best for community detection.

Measuring mutual information from finite data is difficult. Recent work has considered variational methods maximizing a lower bound. In this paper, we prove that serious statistical limitations are inherent to any method of measuring mutual information. More specifically, we show that any distribution-free high-confide…

2018-11-10abs ↗pdf ↗

This study analyzes mutual influence on investment strategies of financial market agents.

problem Mutual influence among agents in financial markets and its impact on investment strategies.
method Formulated optimal investment differential game problem, derived analytical solutions, proposed fast algorithm, and theoretically analyzed mutual influence.
result Agents' optimal strategies converge to the asymptotic strategy when mutual influence is strong and approaches infinity.

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

Study examines Indian equity mutual funds' investment style and risk-shifting.

problem Understanding how Indian equity mutual funds' investment styles affect their returns.
method Estimating size and style beta coefficients, identifying breakpoints, analyzing investment styles, and assessing risk-shifting intensity.
result Funds can enhance returns by shifting to high-return styles like Small Value and Small Blend.

Proposes a framework to maximize mutual information in VAE models for better latent code representation.

problem Lack of explicit measurement of the quality of learned representations in VAE models.
method Variational Mutual Information Maximization Framework for VAE.
result Maximizes mutual information between latent codes and observations, improving latent code representation.

The paper proposes a method to learn structured representations from unlabeled data using mutual information maximization.

problem Learning structured representations from unlabeled data.
method Adversarial maximization of mutual information between a structured latent variable and a target variable.
result The proposed method outperforms current baselines in document hashing and yields highly compressed interpretable representations.

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.

Traditional nearest points methods use all the samples in an image set to construct a single convex or affine hull model for classification. However, strong artificial features and noisy data may be generated from combinations of training samples when significant intra-class variations and/or noise occur in the image s…

2014-03-03abs ↗pdf ↗

Sequence models assign probabilities to variable-length sequences such as natural language texts. The ability of sequence models to capture temporal dependence can be characterized by the temporal scaling of correlation and mutual information. In this paper, we study the mutual information of recurrent neural networks …

2019-05-10abs ↗pdf ↗

Active feature selection uses mutual information to choose fewer labels for better feature selection.

problem Selecting features with limited labeled data.
method Uses active feature selection with mutual information criterion, optimizing label selection for better feature quality.
result Algorithm selects features with higher mutual information using fewer labels than the data set size.

The paper introduces submodular information measures for machine learning applications.

problem Generalizing information-theoretic measures to non-random variables.
method Developing combinatorial information measures based on submodular functions.
result Submodular mutual information is submodular in one argument for certain submodular functions.

We argue that the estimation of mutual information between high dimensional continuous random variables can be achieved by gradient descent over neural networks. We present a Mutual Information Neural Estimator (MINE) that is linearly scalable in dimensionality as well as in sample size, trainable through back-prop, an…

2018-01-12abs ↗pdf ↗

Paper proposes a novel method to reduce mutual information for missing data imputation.

problem Missing data imputation in datasets with missingness patterns.
method Iterative minimization of KL divergence between imputed data and missingness mask, using rectified flow training objective.
result The proposed method achieves superior imputation performance on synthetic and real-world datasets.

This text presents some basic notions in symplectic geometry, Poisson geometry, Hamiltonian systems, Lie algebras and Lie groups actions on symplectic or Poisson manifolds, momentum maps and their use for the reduction of Hamiltonian systems. It should be accessible to readers with a general knowledge of basic notions …

2014-01-31abs ↗pdf ↗

Sparse portfolio strategy from mutual funds' favorite stocks in China A share market.

problem Building a sparse portfolio from mutual funds' favorite stocks in a market with limited fund information.
method Analyzed mutual fund favorite stocks, used portfolio optimizer with constraints, and compared different methods.
result Sparse portfolios consistently outperform the benchmark index 930950.CSI.

This paper considers mutual obligations in the interconnected bank system and analyzes their influence on joint and marginal survival probabilities as well as CDS and FTD prices for the individual banks. To make the role of mutual obligations more transparent, a simple structural default model with banks' assets driven…

2015-05-08abs ↗pdf ↗

This study tackles mutual fund portfolio prediction, focusing on novel items.

problem Predicting novel items in mutual fund portfolios is challenging and less explored.
method Created a comprehensive benchmark dataset and evaluated various recommender system models.
result Autoencoder-based approaches outperform state-of-the-art models in predicting novel items.