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

Trend · papers per month

11233445 · Jun 202019922001200920172026
48 results for overlapping categories

GAME improves matrix completion by considering subgroup-specific latent structures.

problem Heterogeneous data with overlapping categories, smoothing away subgroup-specific variation.
method Group-Aware Matrix Estimation (GAME) with overlapping nuclear-norm penalties.
result GAME outperforms global low-rank estimators in structured missingness regimes.

This work draws inspiration from three important sources of research on dissimilarity-based clustering and intertwines those three threads into a consistent principled functorial theory of clustering. Those three are the overlapping clustering of Jardine and Sibson, the functorial approach of Carlsson and Mémoli to par…

2016-09-08abs ↗pdf ↗

EAGC boosts GCD by regulating gradient entanglement, improving known and novel category separability.

problem Gradient entanglement distorts supervised gradients and overlaps known and novel class representations.
method EAGC uses AGA and EEP to align and project gradients, reducing entanglement and overlap.
result EAGC consistently boosts GCD performance, setting new state-of-the-art results.

Paper presents a deep learning framework for classifying respiratory anomalies and lung diseases from sound recordings.

problem Classifying respiratory anomalies and lung diseases from respiratory sound recordings.
method The framework uses front-end feature extraction to transform sound into spectrograms, and a deep learning network to classify these features.
result The proposed deep learning system outperforms current state-of-the-art methods on the ICBHI benchmark dataset.

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 ↗

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.

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.

Overlap between treatment groups is required for non-parametric estimation of causal effects. If a subgroup of subjects always receives the same intervention, we cannot estimate the effect of intervention changes on that subgroup without further assumptions. When overlap does not hold globally, characterizing local reg…

2019-07-09abs ↗pdf ↗

Study on Langevin dynamics for recovering planted signals in spiked matrix models.

problem Recovering a planted signal in spiked matrix models.
method Path-wise characterization of overlap using integro-differential equations and explicit formula derivation.
result Sharp phase transition in limiting overlap: positive in one regime, zero in another due to injected noise.

Determining the extent to which different cognitive modalities (understood here as the set of cognitive processes underlying the elaboration of a stimulus by the brain) rely on overlapping neural representations is a fundamental issue in cognitive neuroscience. In the last decade, the identification of shared activity …

2019-10-08abs ↗pdf ↗

K-fold Cross Validation is commonly used to evaluate classifiers and tune their hyperparameters. However, it assumes that data points are Independent and Identically Distributed (i.i.d.) so that samples used in the training and test sets can be selected randomly and uniformly. In Human Activity Recognition datasets, we…

2019-04-04abs ↗pdf ↗

Study on overlaps of singular vectors in Gaussian matrix submatrices.

problem Analyzing overlaps of singular vectors in submatrices of Gaussian matrices.
method Utilizes dynamics of singular vectors and specific resolvents for Brownian trajectories.
result Explicit forms for limiting rescaled mean squared overlaps in the bulk of spectra.

Deconfounding scores improve causal effect estimation with weak overlap.

problem Poor overlap in treatment and control groups makes causal effect estimators brittle.
method Introduces feature representations that improve overlap without introducing bias.
result Deconfounding scores satisfy a zero-covariance condition that is identifiable in observed data.

Improved off-policy evaluation for MDPs with weak distributional overlap.

problem Evaluation of policies when target and data-collection distributions are not strongly overlapping.
method Truncated Doubly Robust (TDR) estimators for off-policy evaluation in MDPs under weak distributional overlap.
result TDR estimators can recover large-sample behavior and are consistent even when distribution ratios are not square-integrable.

A new overlapping space solves the configuration search problem for graph embeddings.

problem Configuring product spaces for graph embeddings is resource-intensive and impractical.
method Introducing overlapping spaces that share subsets of coordinates between different types of spaces (Euclidean, hyperbolic, spherical).
result Overlapping spaces achieve nearly optimal results without configuration tuning, reducing training time.

Sliced inverse regression (SIR) is a pioneer tool for supervised dimension reduction. It identifies the effective dimension reduction space, the subspace of significant factors with intrinsic lower dimensionality. In this paper, we propose to refine the SIR algorithm through an overlapping slicing scheme. The new algor…

2018-06-23abs ↗pdf ↗

CnGAN generates synthetic user preferences for non-overlapped users in cross-network recommender systems.

problem Cross-network recommender solutions ignore non-overlapped users, limiting their applicability.
method Multi-task learning, encoder-GAN architecture, user-based pairwise loss function.
result Generated user preferences improve recommendations for non-overlapped users, achieving superior performance.

A new method optimizes anomaly scoring from score distribution to improve AD performance.

problem Vulnerability to anomaly contamination and lack of adaptability in existing AD methods.
method Optimizes anomaly scoring function from score distribution perspective, using Overlap loss.
result Overlap loss-based AD models significantly outperform state-of-the-art methods.

GC-FCP provides efficient federated CP with group-conditional coverage guarantees.

problem Uncertainty quantification in federated settings with distributed calibration data.
method Group-conditional federated conformal prediction (GC-FCP) using group-stratified coresets.
result GC-FCP offers efficient aggregation and calibration compared to centralized methods.

A new method reduces communication costs in distributed learning.

problem Reduces communication bottlenecks in distributed learning.
method Local SGD with communication-computation overlap and delay-corrected sparse model averaging.
result Theoretical convergence guarantees for smooth non-convex objectives.

Statistical test verifies long-term rating system calibration with overlapping time windows.

problem Verifying supervisory requirements for overlapping time windows in rating systems.
method Analyzes long-run default rate distribution and correlation effects; presents conservative calibration test methods.
result Developed a test for individual and portfolio levels that can handle unknown variance.

The paper addresses causal estimation for text data with apparent overlap violations.

problem Estimating causal effects from text data with unknown confounders and apparent overlap.
method Uses supervised representation learning to create a representation that preserves confounding information while eliminating predictive information, satisfying overlap assumptions.
result Shows how to obtain robust causal estimation in the presence of apparent overlap violations.