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

Trend · papers per month

4.2%8.3%12.5%16.7% · Oct 199519922001200920172026
48 results for overlap decomposition

Sparse spectral decomposition identifies overlapping communities in networks.

problem Estimating overlapping community memberships in networks where nodes can belong to multiple communities.
method Sparse principal subspace estimation with iterative thresholding.
result The fixed point of the algorithm corresponds to correct node memberships under the stochastic block model.

We discuss structured Schatten norms for tensor decomposition that includes two recently proposed norms ("overlapped" and "latent") for convex-optimization-based tensor decomposition, and connect tensor decomposition with wider literature on structured sparsity. Based on the properties of the structured Schatten norms,…

2013-03-26abs ↗pdf ↗

We develop a generalisation of disentanglement in VAEs---decomposition of the latent representation---characterising it as the fulfilment of two factors: a) the latent encodings of the data having an appropriate level of overlap, and b) the aggregate encoding of the data conforming to a desired structure, represented t…

2018-12-06abs ↗pdf ↗

The paper provides concentration inequalities for Markov chain variance estimators.

problem Estimating the variance of Markov chains with concentration properties.
method Martingale decomposition method for uniformly geometrically ergodic Markov chains.
result Explicit control of the p-th moment of the OBM estimator difference and dependence on p and mixing time.

The paper derives upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.

problem Finding upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.
method Using spectral decompositions and consistency conditions derived from quadruple overlap integrals in terms of triple overlap integrals.
result Derives upper bounds on eigenvalues, nearly saturated by the Bolza surface.

Unified theory of ownership concentration, overlap, and dependence.

problem Understanding the complex layers of ownership concentration, overlap, and dependence in financial markets.
method Develops a unified quadratic framework for analyzing these layers and their interactions.
result Unified framework shows that the same residual operator measures static overlap and governs linearized market transmission.

Unified framework for geometric computation of minimum-area homotopy.

problem Computing the minimum homotopy area of a closed curve.
method Unified combinatorial word approach combining geometric and algebraic methods.
result Unified geometric proof and constructive algorithm for minimum area homotopy.

Sparse Singular Value Decomposition (SVD) models have been proposed for biclustering high dimensional gene expression data to identify block patterns with similar expressions. However, these models do not take into account prior group effects upon variable selection. To this end, we first propose group-sparse SVD model…

2018-07-28abs ↗pdf ↗

The paper bounds eigenvalues and integrals of eigenfunctions on hyperbolic manifolds.

problem Eigenvalues and integrals of eigenfunctions on compact hyperbolic manifolds.
method Spectral decompositions and consistency conditions derived from quadruple overlap integrals.
result Upper bounds on Laplacian eigenvalues and triple overlap integrals.

We investigate intersections of geodesic lines in H2H^2 and in an associated tree T, proving the following result. Let M be a punctured hyperbolic torus and let γγ be a closed geodesic in M. Any edge of any triangle formed by distinct geodesic lines in the preimage of γγ in H2H^2 is shorter then γγ. However, a simil…

2018-06-08abs ↗pdf ↗

Paper identifies sparse structures and communities in heterogeneous graphical models.

problem Detecting community structures in graphical models.
method Novel decomposition into sparse and low-rank parts, three-stage estimation procedure.
result Consistent model selection for adaptive 1\ell_1 penalized estimator.

Community detection is the task of detecting hidden communities from observed interactions. Guaranteed community detection has so far been mostly limited to models with non-overlapping communities such as the stochastic block model. In this paper, we remove this restriction, and provide guaranteed community detection f…

2013-02-12abs ↗pdf ↗

We empirically analyze the price and liquidity responses to trade signs, traded volumes and signed traded volumes. Utilizing the singular value decomposition, we explore the interconnections of price responses and of liquidity responses across the whole market. The statistical characteristics of their singular vectors …

2017-11-21abs ↗pdf ↗

Core-Halo solves large-scale fixed-point problems by decentralizing updates.

problem Large-scale fixed-point equations with block dependencies.
method Core-Halo decomposition separates write ownership from read-only context, aligning with block-dependence structure.
result Core-Halo achieves near-centralized performance while retaining parallelism.

The paper explores the tradeoffs between fairness measures in machine learning.

problem The challenge of achieving all three fairness notions simultaneously in machine learning models.
method The approach uses partial information decomposition (PID) to analyze the relationships between fairness measures.
result Identifies the regions where fairness measures overlap and disagree, revealing potential tradeoffs.

Many signal processing algorithms break the target signal into overlapping segments (also called windows, or patches), process them separately, and then stitch them back into place to produce a unified output. At the overlaps, the final value of those samples that are estimated more than once needs to be decided in som…

2018-08-20abs ↗pdf ↗

Unified framework detects change-points and estimates parameters in nonlinear systems with regime switching.

problem Detecting change-points and estimating parameters in nonlinear dynamical systems with regime transitions.
method Residual-loss anomaly analysis of physics-informed neural networks, two-stage strategy.
result The method outperforms traditional approaches in change-point localization and parameter estimation accuracy.

Mapper-GIN simplifies 3D point cloud classification with lightweight structure.

problem Robust 3D point cloud classification under corruption.
method Mapper algorithm for structural decomposition, GIN for graph classification.
result Mapper-GIN achieves competitive accuracy with minimal parameters.

The paper proves properties of Bergman spaces and Schiffer operators on Riemann surfaces with quasicircles.

problem Properties of Bergman spaces and Schiffer operators on Riemann surfaces with quasicircles.
method Proof of isomorphism of Schiffer operators and application to Plemelj-Sokhotski isomorphism and jump decomposition.
result Schiffer integral operator is an isomorphism between Bergman spaces on different subsets of a Riemann surface.

FreDN separates trends and periodicities in non-stationary time series forecasts.

problem Spectral entanglement and computational burden in frequency-domain methods for non-stationary time series.
method FreDN introduces a learnable Frequency Disentangler module to separate trend and periodic components directly in the frequency domain, and uses a ReIm Block to reduce complexity.
result FreDN outperforms state-of-the-art methods by up to 10% on long-term forecasting benchmarks.

Overlapping clustering problem is an important learning issue in which clusters are not mutually exclusive and each object may belongs simultaneously to several clusters. This paper presents a kernel based method that produces overlapping clusters on a high feature space using mercer kernel techniques to improve separa…

2012-11-29abs ↗pdf ↗

Deconfounding scores improve causal effect estimation with weak overlap.

problem Challenges in causal treatment effect estimation due to weak overlap in high-dimensional data.
method Propose deconfounding scores to preserve identification and target estimation while improving overlap.
result Prognostic scores are overlap-optimal under a broad family of generalized linear models with Gaussian features.

A new method speeds up overlapping group lasso computations.

problem Time-consuming optimization of overlapping group lasso on large-scale problems.
method Non-overlapping statistical approximation to overlapping group lasso.
result The proposed penalty is statistically equivalent to overlapping group lasso.

Proposes a sensitivity framework to handle limited overlap in causal inference.

problem Limited overlap between treated and control groups in observational studies.
method Sensitivity framework based on worst-case confidence bounds on bias introduced by trimming.
result Protects against spurious findings by quantifying uncertainty in regions with limited overlap.

Producing overlapping schemes is a major issue in clustering. Recent proposed overlapping methods relies on the search of an optimal covering and are based on different metrics, such as Euclidean distance and I-Divergence, used to measure closeness between observations. In this paper, we propose the use of another meas…

2012-11-29abs ↗pdf ↗

The study simplifies assessing overlap in logistic regression models using empirical likelihood.

problem Assessing overlap in multidimensional logistic regression models.
method Translation of Silvapulle's condition to empirical likelihood maximization, mechanized with R code.
result Minimal overlapping structures are cataloged in dimensions less than four, providing rules for higher dimensions.

Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because…

2014-10-25abs ↗pdf ↗

New method detects long-term structures with internal dynamics in time series data.

problem Identifying patterns across time in data growth.
method Adaptive identification of majority overlaps between groups at different time points.
result Detection of persistent structural elements with internal dynamics.

Community detection is a fundamental problem in network analysis which is made more challenging by overlaps between communities which often occur in practice. Here we propose a general, flexible, and interpretable generative model for overlapping communities, which can be thought of as a generalization of the degree-co…

2014-12-10abs ↗pdf ↗

RISA improves VFL by using imputed samples with low uncertainty.

problem Limited overlapping samples constrain VFL performance.
method Imputing non-overlapping samples and using evidence theory to select reliable imputed samples.
result Significant performance gains achieved, especially with limited overlapping samples.

Overlap-Local-SGD improves distributed SGD by overlapping communication and computation.

problem High communication delay and node slowdown in distributed SGD.
method Adding an anchor model to synchronize local updates and pull them towards the anchor model.
result Overlap-Local-SGD speeds up distributed training and mitigates straggler effects.

The growing use of neuroimaging technologies generates a massive amount of biomedical data that exhibit high dimensionality. Tensor-based analysis of brain imaging data has been proved quite effective in exploiting their multiway nature. The advantages of tensorial methods over matrix-based approaches have also been de…

2016-07-15abs ↗pdf ↗

New LT-O-learners improve HLTE estimation with low overlap.

problem Challenges in estimating heterogeneous long-term treatment effects due to limited overlap.
method Introduces LT-O-learners that use custom overlap weights to downweight low-overlap samples.
result LT-O-learners provide robust HLTE estimates with lower variance in low-overlap regimes.