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

Trend · papers per month

68135203270 · May 202619922001200920172026
48 results for heterogeneous matching

Matching two different sets of items, called heterogeneous set-to-set matching problem, has recently received attention as a promising problem. The difficulties are to extract features to match a correct pair of different sets and also preserve two types of exchangeability required for set-to-set matching: the pair of …

2019-10-22abs ↗pdf ↗

The paper introduces heterogeneous manifolds for better graph embeddings.

problem Graph embeddings in Euclidean spaces often fail to capture the curvature of real-world graphs.
method The authors propose heterogeneous rotationally-symmetric manifolds with a radial dimension to account for varying curvature.
result The method improves graph embeddings by better preserving high-order structures and heterogeneous random graphs.

Paper develops efficient recursive learning for multi-channel systems with heterogeneous dynamics.

problem Accurately learning system dynamics in complex, multi-channel systems with nonlinear and noisy data.
method Formulates system as Gaussian process state-space models (GPSSMs), introduces heterogeneous multi-output kernel, and develops recursive inference framework.
result Matches SOTA offline GPSSMs in accuracy with 1/100 runtime, and outperforms SOTA online GPSSMs by 70% in accuracy under noise with 1/20 runtime.

New methods improve tool-to-tool matching in semiconductor manufacturing.

problem Challenges in obtaining static configuration data and extending methods to heterogeneous equipment.
method Novel TTTM analysis pipelines hypothesizing higher variance and modes for mismatched equipment.
result Best univariate method achieves correlation coefficients >0.95 and >0.5 with variance and modes, respectively.

New bounds for LDP with heterogeneous privacy levels guaranteeing high probability of accuracy.

problem Statistical estimation under LDP with users having varying privacy levels.
method Developed finite sample upper bounds in ℓ_2-norm with high probability, complemented by lower bounds.
result Optimal guarantees for heterogeneous LDP in terms of probability and constants.

To compare entities of differing types and structural components, the artificial neural network paradigm was used to cross-compare structural components between heterogeneous documents. Trainable weighted structural components were input into machine-learned activation functions of the neurons. The model was used for m…

2018-01-09abs ↗pdf ↗

We consider the problem faced by a service platform that needs to match limited supply with demand but also to learn the attributes of new users in order to match them better in the future. We introduce a benchmark model with heterogeneous "workers" (demand) and a limited supply of "jobs" that arrive over time. Job typ…

2016-03-15abs ↗pdf ↗

Information systems have widely been the target of malware attacks. Traditional signature-based malicious program detection algorithms can only detect known malware and are prone to evasion techniques such as binary obfuscation, while behavior-based approaches highly rely on the malware training samples and incur prohi…

2019-10-17abs ↗pdf ↗

Proposes a new method to handle data heterogeneity in causal inference.

problem Challenges of collaborating between different data centers due to heterogeneity.
method Collaborative inverse propensity score weighting estimator to adjust for distribution shift.
result Significant improvements over traditional meta-analysis methods when dealing with increased heterogeneity.

We propose the Heterogeneous Thurstone Model (HTM) for aggregating ranked data, which can take the accuracy levels of different users into account. By allowing different noise distributions, the proposed HTM model maintains the generality of Thurstone's original framework, and as such, also extends the Bradley-Terry-Lu…

2019-12-03abs ↗pdf ↗

Rescaled ASGD optimizes distributed learning under heterogeneous data.

problem Vanilla ASGD biases towards a frequency-weighted average of local objectives.
method Rescale worker stepsizes by their computation times.
result Rescaled ASGD converges to the correct global objective in fixed-computation model.

New framework tackles stochastic latent subgroup heterogeneity in online decision-making.

problem Stochastic latent heterogeneity in online decision-making where individual responses vary with unobserved subgroups.
method Latent heterogeneous bandit framework using EM-greedy algorithm to learn subgroup probabilities and reward parameters.
result Achieves optimal estimation and classification guarantees, revealing a fundamental stochastic barrier in online decision-making.

Proposes flexible spatial models for better understanding spatial heterogeneity.

problem Poor characterisation of spatial heterogeneity in conventional models.
method Spatial Bayesian Neural Networks (SBNNs) incorporating a spatial embedding layer and possibly spatially-varying parameters.
result SBNNs better match the finite-dimensional distribution of target spatial processes.

New federated learning protocols improve on knowledge distillation's poor performance.

problem Designing a universal API for federated learning without public data.
method Proposed Federated Kernel ridge regression using knowledge distillation.
result Performance of new protocols closely matches theoretical predictions.

FedForest adapts RF for federated learning, improving performance and efficiency.

problem Adapting RF for federated learning with heterogeneous data.
method FedForest uses a novel splitting procedure to aggregate client statistics, allowing non-parametric personalization.
result FedForest's federated RF achieves performance close to centralized models while being communication-efficient.

QR-learner estimates individual treatment effects using external data.

problem Limited power to detect individual treatment effects in randomized trials.
method Model-agnostic learner that estimates conditional average treatment effects (CATE) using external data.
result QR-learner reduces mean squared error and can recover true CATE.

Federated UCBVI reduces communication costs while minimizing regret in multi-agent settings.

problem Minimizing regret in federated learning with heterogeneous agents.
method Federated Upper Confidence Bound Value Iteration (Fed-UCBVI) algorithm.
result Regret bound scales as ildeO(H3SAT/M) ilde{\mathcal{O}}(\sqrt{H^3 |\mathcal{S}| |\mathcal{A}| T / M}) with small additional term due to heterogeneity.

New method for clustering tasks with heterogeneous data.

problem Clustered multitask learning with semiparametric and heterogeneous nuisances.
method Adaptive fused orthogonal estimator with Neyman-orthogonal losses and data-driven fusion penalties.
result Achieves exact clustering recovery and pooled parametric convergence rates.

New algorithms select and rank features from MTS without feature extraction.

problem Feature extraction step for MTS classification.
method Directly computes similarity between time series and assesses cluster structure matching labels.
result Techniques match labels well without feature extraction.

Unified analysis of federated learning with compression for various data distributions.

problem Communication overhead in federated learning with unreliable or limited communication.
method Periodic compressed communication and local gradient tracking schemes.
result Sharp convergence rates for various objective functions and data distributions.

This paper studies generalization in machine learning with mixture data.

problem Generalization performance and statistical rates in heterogeneous data.
method Characterization of heterogeneity via pairwise total variation distance, analysis of Rademacher and Gaussian complexities.
result The requirement on heterogeneity increases as function classes get more complex.

Study tackles contamination and heterogeneity in multi-task learning, improving robustness and personalization.

problem Challenges in integrating related tasks due to contamination and heterogeneity.
method Proposes a filtering-based robust multi-task gradient descent method to estimate global and clean task-specific minimizers.
result Demonstrates improved robustness and personalization compared to existing methods.

New method tightens federated probe-logit distillation rates under varying bandwidths.

problem Estimating conditional distributions in federated learning with heterogeneous bandwidth constraints.
method Developed a new federated probe-logit distillation (FPLD) method with optimal allocation for varying bandwidths.
result Achieved matching lower and upper bounds for the minimax rate under heterogeneous bandwidths.

Method identifies unknown intervention targets in structural causal models from diverse data.

problem Identifying unknown intervention targets in structural causal models from heterogeneous data.
method Two-phase approach: first recovers exogenous noises, second matches with endogenous variables.
result Proposed method uniquely identifies intervention targets under causal sufficiency assumption.

A novel federated learning framework resolves structural misalignment in model fusion.

problem Structural misalignment in model fusion due to chaotic information distribution.
method Feature-oriented regulation method (ΨΨ-Net) to ensure feature information allocation and dedicated collaboration schemes.
result Effective enhancement of federated learning applicability to heterogeneous settings with improved convergence speed, accuracy, and efficiency.

Many scientific and engineering challenges -- ranging from pharmacokinetic drug dosage allocation and personalized medicine to marketing mix (4Ps) recommendations -- require an understanding of the unobserved heterogeneity in order to develop the best decision making-processes. In this paper, we develop a hypothesis te…

2017-08-14abs ↗pdf ↗

Heterogeneous domain adaptation (HDA) aims to facilitate the learning task in a target domain by borrowing knowledge from a heterogeneous source domain. In this paper, we propose a Soft Transfer Network (STN), which jointly learns a domain-shared classifier and a domain-invariant subspace in an end-to-end manner, for a…

2019-08-28abs ↗pdf ↗

Study optimizes data collection from biased, costly sources to minimize risk.

problem Estimating population means and group-conditional means from multiple sources with varying costs and biases.
method Develops a sampling plan that maximizes effective sample size, paired with a post-stratification estimator.
result Achieves budgeted minimax optimal risk for estimating population means and group-conditional means.

New algorithms reduce matching market regret to log(T) with improved stability.

problem Minimizing regret in two-sided matching markets with bandit feedback.
method Phase-based algorithm with local arm deletion to improve stability.
result Achieves Θ(log(T)) regret for markets with uniqueness consistency.

Paper introduces Functional Effects Models to account for individual heterogeneity in panel data.

problem Accounting for preference heterogeneity in panel data with machine learning.
method Functional Effects Models using gradient boosting decision trees and deep neural networks to learn individual-specific preference parameters.
result Functional Effects Models outperform traditional models in learning inter-individual heterogeneity and predictive performance.

Method uses pseudo-samples to improve RCT data in ride-hailing pricing studies.

problem Small and biased RCT data leads to significant bias when generalizing to broader user base.
method Pseudo-sample matching to expand and match RCT data with observational data.
result 0.41% improvement in profit through pseudo-sample matching.

We consider a simple market where a vendor offers multiple variants of a certain product and preferences of both the vendor and potential buyers are heterogeneous and possibly even antagonistic. Optimization of the joint benefit of the vendor and the buyers turns the toy market into a combinatorial matching problem. We…

2009-02-03abs ↗pdf ↗

Paper proposes SCALLION and SCAFCOM for compressed FL with reduced communication.

problem Reducing communication overhead in Federated Learning with data heterogeneity and partial participation.
method Revisit and simplify stochastic controlled averaging, proposing SCALLION and SCAFCOM for unbiased and biased compression.
result SCALLION and SCAFCOM outperform existing methods in communication and computation complexities.