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

Trend · papers per month

6111722 · Sep 201919922001200920172026
48 results for audience overlap

Adaptive algorithm for online evaluation of targeted audiences in advertising.

problem Determining the right match between advertising creatives and target audiences.
method Contextual bandit approach to address audience overlap and learn optimal display policies.
result The proposed method is more efficient than traditional split-testing methods.

These notes grew out of a lecture series given at RIMS in the summer of 2001. The lecture series was aimed at a broad audience that included many graduate students. Its purpose lay in familiarizing the audience with the basics of 3-manifold theory and introducing some topics of current research. The first portion of th…

2005-04-08abs ↗pdf ↗

Cascades of information-sharing are a primary mechanism by which content reaches its audience on social media, and an active line of research has studied how such cascades, which form as content is reshared from person to person, develop and subside. In this paper, we perform a large-scale analysis of cascades on Faceb…

2016-02-02abs ↗pdf ↗

This is an expository article with complete proofs intended for a general non-specialist audience. The results are two-fold. First, we discuss a geometric invariant, that we call the width, of a manifold and show how it can be realized as the sum of areas of minimal 2-spheres. For instance, when MM is a homotopy 3-sph…

2007-07-01abs ↗pdf ↗

MGM improves media profiling by integrating textual and structural features.

problem Evaluating the bias and factuality of news media from digital data.
method MediaGraphMind (MGM) framework using variational EM, integrating textual and structural features.
result Achieves new state-of-the-art results in media profiling.

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.

In recent work the author investigates perfect matchings of a bipartite graph obtained from a knot diagram and demonstrates that these correspond to discrete Morse functions on a 2-complex for the 2-sphere. This relationship is expounded below for the opposite audience: those who may be unfamiliar with knots.

2012-11-12abs ↗pdf ↗

New model uses symmetries and scaling laws to predict consumer advertising response.

problem Understanding consumer response to advertising efforts.
method Introduces a physics-based mathematical model to describe consumer response dynamics.
result The model better captures nonlinearities in advertising effects and provides new parameters for audience engagement.

Agol proved that hyperbolic cubulated groups are virtually special. The aim of these notes is to make the proof accessible to a wider audience; we retain the underlying ideas and constructions of Agol, but substantially change or add to many parts of the argument to give a more transparent and detailed account.

2019-05-15abs ↗pdf ↗

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.

Optimizes revenue and performance goals in e-commerce advertising with budget constraints.

problem Maximizing revenue and satisfying multiple performance goals in e-commerce advertising systems.
method Linear programming approach to optimize revenue and performance goals simultaneously.
result Our algorithm improves campaign performance and platform revenue effectively.

This is a draft of a textbook on differential forms. The primary target audience is sophmore level undergraduates enrolled in what would traditionally be a course in vector calculus. Later chapters will be of interest to advaced undergraduate and beginning graduate students. Applications include brief introductions to …

2003-06-11abs ↗pdf ↗

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.

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.

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.

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.