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

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for Dual Total Correlation

GCAE uses density estimation to achieve reliable disentanglement in latent space.

problem Disentangled learning representations suffer from reliability issues.
method GCAE uses Gaussian Channel Autoencoder with Dual Total Correlation (DTC) to avoid the curse of dimensionality.
result GCAE achieves highly competitive and reliable disentanglement scores.

Totally geodesic dual leaves on curved manifolds are also curved.

problem Characterizing dual leaves of nonnegatively curved polar manifolds.
method Proving dual leaves are totally geodesic and closed, and inducing a Riemannian submersion.
result Dual leaves of nonnegatively curved polar manifolds are themselves nonnegatively curved and totally geodesic.

Paper addresses the disparity between sampled and mean representations in disentangled learning.

problem Disparity between sampled and mean representations in disentangled learning.
method Proposes a method to eliminate the disparity by proving and utilizing the relationship between total correlation of sampled and mean representations for multivariate normal distributions.
result Demonstrates that a factorized mean representation can have lower total correlation than the sampled representation.

Many supervised learning tasks are emerged in dual forms, e.g., English-to-French translation vs. French-to-English translation, speech recognition vs. text to speech, and image classification vs. image generation. Two dual tasks have intrinsic connections with each other due to the probabilistic correlation between th…

2017-07-03abs ↗pdf ↗

The paper finds circle packings with specific curvatures in hyperbolic geometry.

problem Finding circle packings with prescribed total geodesic curvatures and discrete Gaussian curvatures.
method Established existence and rigidity via variational principle, introduced combinatorial p-th Calabi flows.
result Introduced combinatorial p-th Calabi flows to find circle packings with prescribed curvatures.

We investigate the two components of the total daily return (close-to-close), the overnight return (close-to-open) and the daytime return (open-to-close), as well as the corresponding volatilities of the 2215 NYSE stocks from 1988 to 2007. The tail distribution of the volatility, the long-term memory in the sequence, a…

2009-03-05abs ↗pdf ↗

We decompose the evidence lower bound to show the existence of a term measuring the total correlation between latent variables. We use this to motivate our ββ-TCVAE (Total Correlation Variational Autoencoder), a refinement of the state-of-the-art ββ-VAE objective for learning disentangled representations, requiring n…

2018-02-14abs ↗pdf ↗

In this paper we develop a relative version of T-duality in generalized complex geometry which we propose as a manifestation of mirror symmetry. Let M be an n-dimensional smooth real manifold, V a rank n real vector bundle on M, and nabla a flat connection on V. We define the notion of a nabla-semi-flat generalized com…

2004-05-14abs ↗pdf ↗

Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.

problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.

We study the totally null surfaces of the neutral Kaehler metric on certain 4-manifolds. The tangent spaces of totally null surfaces are either self-dual (αα-planes) or anti-self-dual (ββ-planes) and so we consider αα-surfaces and ββ-surfaces. The metric of the examples we study, which include the spaces of oriente…

2008-10-22abs ↗pdf ↗

The paper studies dual pairs of generic conformally flat hypersurfaces in 4-space.

problem Understanding the relationship between a generic conformally flat hypersurface and its dual.
method Developing discrete hypersurfaces of the dual for all positive integers n, and constructing approximations from dual invariants.
result Clarifying the correspondence between a generic conformally flat hypersurface and its dual in R4\mathbb{R}^4.

Extends polydisk theorem to Hartogs domains over symmetric domains.

problem Rigidity phenomena in Riemannian manifolds.
method Extension of polydisk theorem to Hartogs domains over arbitrary symmetric domains.
result Dual of a Hartogs domain over a bounded symmetric domain admits no totally geodesic immersion into any compact Riemannian manifold.

The study examines correlations of logarithms of integers at different scalings.

problem Analyzing pair correlations of logarithms of integers at various scalings.
method Examined correlations of logarithms of positive integers at different scalings, proving the existence of pair correlation functions.
result Level repulsion at linear scaling, total loss of mass at superlinear scalings, and Poissonian behavior at sublinear scalings.

An index theorem for the anti-self-dual deformation complex on anti-self-dual orbifolds with singularities conjugate to ADE-type is proved. In 1988, Claude Lebrun gave examples of scalar-flat Kähler ALE metrics with negative mass, on the total space of the bundle O(n)\mathcal{O}(-n) over S2S^2. A corollary of this index …

2012-02-02abs ↗pdf ↗

New method for tensor completion using nonconvex dual total variation.

problem Tensor completion from partial measurements with exponential-family noise.
method Proposed dual-TV (DTV) regularizers for tensor completion under exponential-family noise.
result Theoretical upper bounds on recovery error for tensor completion.

We present a novel method for solving Canonical Correlation Analysis (CCA) in a sparse convex framework using a least squares approach. The presented method focuses on the scenario when one is interested in (or limited to) a primal representation for the first view while having a dual representation for the second view…

2009-08-19abs ↗pdf ↗

New method adapts DLMs to intrinsic data dependence without prior knowledge.

problem Understanding how unmasking schedules affect DLM generation quality.
method Adapts unmasking schedule to target data distribution's dependence structure.
result Sampling convergence guarantees improve for low-complexity distributions.

We construct the Nahm transform for Higgs bundles over a Riemann surface of genus at least 2 as hyperholomorphic connections on the total space of the tangent bundle of its dual Jacobian.

2007-02-27abs ↗pdf ↗

This work improves texture segmentation by automatically tuning hyperparameters for Total-Variation.

problem The challenge is to automatically select hyperparameters for Total-Variation texture segmentation.
method The approach involves extending Stein's unbiased gradient estimator to handle correlated Gaussian noise, leading to an automatic tuning method.
result The method provides an automatic way to select hyperparameters for Total-Variation texture segmentation.

Paper relaxes differential privacy for correlated features, improving privacy-utility trade-off.

problem Standard differential privacy ignores feature correlation, leading to suboptimal privacy-utility balance.
method Introduces CorrDP framework that accounts for feature correlation, using total variation distance for quantification.
result CorrDP algorithms outperform standard DP in synthetic and real-world datasets with insensitive features.

Model predicts Chinese stock market liquidity and customer order behavior.

problem Understanding market liquidity and customer order behavior in the Chinese stock market.
method Dual state-space model using Fourier transform to connect volume-at-price buckets to correlations.
result Customer orders are correlated with market sentiment and stock returns, not with bond returns.

Learning by children and animals occurs effortlessly and largely without obvious supervision. Successes in automating supervised learning have not translated to the more ambiguous realm of unsupervised learning where goals and labels are not provided. Barlow (1961) suggested that the signal that brains leverage for uns…

2017-06-27abs ↗pdf ↗

The paper analyzes the bias-variance tradeoff for Bregman divergences.

problem Understanding the bias-variance tradeoff for Bregman divergences.
method Analyzes the bias-variance tradeoff through operations in dual space.
result Derives several results including a generalized law of total variance and ensembling operations.

Advances in unsupervised learning enable reconstruction and generation of samples from complex distributions, but this success is marred by the inscrutability of the representations learned. We propose an information-theoretic approach to characterizing disentanglement and dependence in representation learning using mu…

2018-02-16abs ↗pdf ↗

The paper finds Riemannian metric representatives for Stiefel-Whitney classes.

problem Finding representatives of Stiefel-Whitney classes using Riemannian metrics.
method Using Whitney's criteria and properties of Riemannian metrics, the paper constructs representatives for all Stiefel-Whitney classes.
result The representatives of Stiefel-Whitney classes are derived from the determinant of the metric and other geometric properties.

We study the relationship between catastrophic forgetting and properties of task sequences. In particular, given a sequence of tasks, we would like to understand which properties of this sequence influence the error rates of continual learning algorithms trained on the sequence. To this end, we propose a new procedure …

2019-08-02abs ↗pdf ↗

In this paper, we consider a class of finite-sum convex optimization problems whose objective function is given by the summation of mm (1\ge 1) smooth components together with some other relatively simple terms. We first introduce a deterministic primal-dual gradient (PDG) method that can achieve the optimal black-bo…

2015-07-08abs ↗pdf ↗

Research examines correlations of complex logarithms of lattice points, showing level repulsion and Poissonian behavior.

problem Analyzing correlations of complex logarithms of lattice points.
method Proving existence of pair correlation functions and examining behavior at various scalings.
result Level repulsion observed at linear scaling, Poissonian behavior at sublinear scalings.

Mutually interacting components form complex systems and the outputs of these components are usually long-range cross-correlated. Using wavelet leaders, we propose a method of characterizing the joint multifractal nature of these long-range cross correlations, a method we call joint multifractal analysis based on wavel…

2016-11-03abs ↗pdf ↗

Measuring comodules are defined and shown to provide a useful generalization of the set of maps between modules with a broad range of applications. Three applications are described. Connections on bundles are described in terms of measuring comodules, enabling curvature to be defined under general algebraic circumstanc…

1998-06-26abs ↗pdf ↗

The paper introduces a statistical version of contact CR-product for Sasakian statistical manifolds.

problem Characterizing geometric properties of contact CR-submanifolds in Sasakian statistical manifolds.
method Characterization of integrability of invariant and anti-invariant distributions, development of results on specific types of contact CR submanifolds, introduction of statistical contact CR-product.
result Introduction of a statistical version of contact CR-product for Sasakian statistical manifolds.

Dual PC algorithm improves structure learning of Bayesian networks.

problem Learning the structure of Bayesian networks from observational data.
method Dual PC algorithm, leveraging covariance and precision matrices, and partial correlations.
result The dual PC algorithm outperforms the classic PC algorithm in structure recovery, even with non-Gaussian data.