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.
ION-C solves overlapping network integration problems efficiently.
New LT-O-learners improve HLTE estimation with low overlap.
New method improves CATE estimation in low overlap regions.
Bayesian supertrees method uses variational Bayes for overlapping taxon subsets.
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…
We find prominent similarities in the features of the time series for the (model earthquakes or) overlap of two Cantor sets when one set moves with uniform relative velocity over the other and time series of stock prices. An anticipation method for some of the crashes have been proposed here, based on these observation…
New mechanism detects overlap density for weak-to-strong generalization.
We find prominent similarities in the features of the time series for the overlap of two Cantor sets when one set moves with uniform relative velocity over the other and time series of stock prices. An anticipation method for some of the crashes have been proposed here, based on these observations.
This article introduces proximal planar vortex 1-cycles, resembling the structure of vortex atoms introduced by William Thomson (Lord Kelvin) in 1867 and recent work on the proximity of sets that overlap either spatially or descriptively. Vortex cycles resemble Thomson's model of a vortex atom, inspired by P.G. Tait's …
A new method reduces communication costs in distributed learning.
Estimates set overlap and similarity using random samples.
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…
Tessellations cover planes without gaps or overlaps.
Deconfounding scores improve causal effect estimation with weak overlap.
We present two sets of theoretical results on the grouped lasso with overlap of Jacob, Obozinski and Vert (2009) in the linear regression setting. This method allows for joint selection of predictors in sparse regression, allowing for complex structured sparsity over the predictors encoded as a set of groups. This flex…
A new overlapping space solves the configuration search problem for graph embeddings.
Compressing word embeddings is important for deploying NLP models in memory-constrained settings. However, understanding what makes compressed embeddings perform well on downstream tasks is challenging---existing measures of compression quality often fail to distinguish between embeddings that perform well and those th…
Improved off-policy evaluation for MDPs with weak distributional overlap.
BayesBag improves reproducibility of Bayesian inference under model misspecification.
New algorithms achieve small prediction regret for learning from overlapping groups.
The goal of confidence-set learning in the binary classification setting is to construct two sets, each with a specific probability guarantee to cover a class. An observation outside the overlap of the two sets is deemed to be from one of the two classes, while the overlap is an ambiguity region which could belong to e…
MODWST improves classification tasks with wavelet scattering.
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…
Deconfounding scores improve causal effect estimation with weak overlap.
New methods for estimating causal effects with limited overlap, using Stable Probability Weighting.
A new method speeds up overlapping group lasso computations.
Temperature scaling fails for distributions with class overlaps, while Mixup improves calibration.
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…
Proposes a sensitivity framework to handle limited overlap in causal inference.
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.
New method for constructing confidence intervals for time series data.
Unified framework for geometric computation of minimum-area homotopy.
New estimator for overlapping community detection in graphs.
Community detection is a fundamental problem in machine learning. While deep learning has shown great promise in many graphrelated tasks, developing neural models for community detection has received surprisingly little attention. The few existing approaches focus on detecting disjoint communities, even though communit…
Paper presents new algorithms for causal discovery with latent variables and overlapping datasets.
New survival learners estimate heterogeneous treatment effects from time-to-event data.
The paper tackles CF in CL by analyzing NTK overlap matrix and proposing OGD.
New study on time series anomaly detection shows overlapping inference improves performance.
Firms implementing digital advertising campaigns face a complex problem in determining the right match between their advertising creatives and target audiences. Typical solutions to the problem have leveraged non-experimental methods, or used "split-testing" strategies that have not explicitly addressed the complexitie…
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…
Semidefinite programs have recently been developed for the problem of community detection, which may be viewed as a special case of the stochastic blockmodel. Here, we develop a semidefinite program that can be tailored to other instances of the blockmodel, such as non-assortative networks and overlapping communities. …
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 …
Scientific practice typically involves repeatedly studying a system, each time trying to unravel a different perspective. In each study, the scientist may take measurements under different experimental conditions (interventions, manipulations, perturbations) and measure different sets of quantities (variables). The res…
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…
We calculate eigenvector overlaps between intersecting time periods of covariance matrices.