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.
New mechanism detects overlap density for weak-to-strong generalization.
A new measure DCSI quantifies separability for density-based clustering.
Improves DRL for long-term causal inference with semiparametric methods.
ION-C solves overlapping network integration problems efficiently.
Algorithm estimates nonparametric mixtures from grouped data.
Using an intuitive concept of what constitutes a meaningful community, a novel metric is formulated for detecting non-overlapping communities in undirected, weighted heterogeneous networks. This metric, modularity density, is shown to be superior to the versions of modularity density in present literature. Compared to …
Unified framework for robust, stable, and efficient density ratio estimation.
The paper analyzes how the one-dimensional Wasserstein distance captures pointwise density differences in finite samples.
GAME improves matrix completion by considering subgroup-specific latent structures.
We develop a framework especially suited to the autocorrelation properties observed in financial times series, by borrowing from the physical picture of turbulence. The success of our approach as applied to high frequency foreign exchange data is demonstrated by the overlap of the curves in Figure (1), since we are abl…
New method estimates density ratio for well-separated distributions using multi-class logistic regression.
We propose a Fourier-based learning algorithm for highly nonlinear multiclass classification. The algorithm is based on a smoothing technique to calculate the probability distribution of all classes. To obtain the probability distribution, the density distribution of each class is smoothed by a low-pass filter separate…
Improves Bridge estimators using f-GAN to minimize RMSE.
New study shows low-degree polynomial algorithms struggle at clause densities close to Fix's.
The aim of this work is to propose a meta-algorithm for automatic classification in the presence of discrete binary classes. Classifier learning in the presence of overlapping class distributions is a challenging problem in machine learning. Overlapping classes are described by the presence of ambiguous areas in the fe…
New method improves Gaussian Mixture Model fitting speed.
HIRM models noisy, sparse, heterogeneous relational data using hierarchical clustering and Dirichlet processes.
Clustering of data sets is a standard problem in many areas of science and engineering. The method of spectral clustering is based on embedding the data set using a kernel function, and using the top eigenvectors of the normalized Laplacian to recover the connected components. We study the performance of spectral clust…
Study on bit threads and their locking properties in holographic spacetimes.
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…
Mapper-GIN simplifies 3D point cloud classification with lightweight structure.
Deconfounding scores improve causal effect estimation with weak overlap.
This paper introduces the kernel mixture network, a new method for nonparametric estimation of conditional probability densities using neural networks. We model arbitrarily complex conditional densities as linear combinations of a family of kernel functions centered at a subset of training points. The weights are deter…
A new method speeds up overlapping group lasso computations.
We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their nonparametric generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the L1-distance between estimated power spectra…
In medicine, visualizing chromosomes is important for medical diagnostics, drug development, and biomedical research. Unfortunately, chromosomes often overlap and it is necessary to identify and distinguish between the overlapping chromosomes. A segmentation solution that is fast and automated will enable scaling of co…
New method improves CATE estimation in low overlap regions.
Proposes a sensitivity framework to handle limited overlap in causal inference.
This paper connects ultrametric overlap gap properties to parametric RDT for symmetric binary perceptrons.
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…
The study simplifies assessing overlap in logistic regression models using empirical likelihood.
We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the -distance between estimated power spectral densities…
Epanechnikov Mean Shift is a simple yet empirically very effective algorithm for clustering. It localizes the centroids of data clusters via estimating modes of the probability distribution that generates the data points, using the `optimal' Epanechnikov kernel density estimator. However, since the procedure involves n…
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…
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…
RISA improves VFL by using imputed samples with low uncertainty.
As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms have been proposed in recent years that are capable of assigning each node to more than a single community. The performance of these algorithms tends to …
We present a principled approach for detecting overlapping temporal community structure in dynamic networks. Our method is based on the following framework: find the overlapping temporal community structure that maximizes a quality function associated with each snapshot of the network subject to a temporal smoothness c…
New method for estimating class proportions in open-set label shift data.
We calculate eigenvector overlaps between intersecting time periods of covariance matrices.
Community detection is a task of fundamental importance in social network analysis that can be used in a variety of knowledge-based domains. While there exist many works on community detection based on connectivity structures, they suffer from either considering the overlapping or non-overlapping communities. In this w…
Unified approach for fair classification with overlapping groups.
New LT-O-learners improve HLTE estimation with low overlap.
Deep generative models based on Generative Adversarial Networks (GANs) have demonstrated impressive sample quality but in order to work they require a careful choice of architecture, parameter initialization, and selection of hyper-parameters. This fragility is in part due to a dimensional mismatch or non-overlapping s…
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…
Study on Langevin dynamics for recovering planted signals in spiked matrix models.
We unify and and address a set of problems in unsupervised learning with a geometric interpretation of those methods, rooted in the phenomenon. Kernel density is viewed symbolically as where the rand…
A new metric evaluates generative models by comparing real and generated samples.