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

192385577769 · Jun 202019922001200920172026
48 results for multiple target parameters

A new method debiases multiple target parameters without IFs.

problem Debiasing multiple target parameters in nonparametric models.
method Kernel Debiased Plug-in Estimation (KDPE) using TMLE and reproducing kernel Hilbert spaces.
result KDPE simultaneously debiases all pathwise differentiable target parameters.

Improved prediction of soil parameters using Multi-target Stacked Generalisation on EDXRF spectra.

problem Challenges in predicting multiple soil parameters accurately from EDXRF spectra.
method Multi-target Stacked Generalisation (MTSG) method combining multiple regression models.
result MTSG significantly improved prediction accuracy for multiple soil parameters, reducing average error from 0.67 to 0.64.

New method uses limited labeled data and multiple starts to adapt models across domains.

problem Accurate predictions in target domain with few labeled data.
method Fine-tuning from multiple adaptive starts, extending UDA methods.
result Minimax-optimal target performance with limited labeled target data.

The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.

problem Understanding multiple-point crossings under linear perturbations.
method Establishes a transversality theorem with Hausdorff measure estimates for exceptional parameter sets.
result Explicit upper bounds on the Hausdorff dimension of the exceptional set.

MT-SGD samples from multiple target distributions using gradient descent.

problem Sampling from multiple unnormalized target distributions.
method Proposes MT-SGD, a flow of intermediate distributions to sample from multiple target distributions.
result Asymptotic analysis shows MT-SGD reduces to multiple-gradient descent for multi-objective optimization.

Malware detection is a popular application of Machine Learning for Information Security (ML-Sec), in which an ML classifier is trained to predict whether a given file is malware or benignware. Parameters of this classifier are typically optimized such that outputs from the model over a set of input samples most closely…

2019-03-13abs ↗pdf ↗

Parameters in deep neural networks which are trained on large-scale databases can generalize across multiple domains, which is referred as "transferability". Unfortunately, the transferability is usually defined as discrete states and it differs with domains and network architectures. Existing works usually heuristical…

2018-04-23abs ↗pdf ↗

RTE enables extrapolation to new tasks by learning task transformations.

problem Learning systems struggle to generalize to unseen tasks.
method Relational Task Extrapolator (RTE) learns task transformations to enable extrapolation.
result RTE substantially outperforms existing approaches on extrapolation tasks.

A new control chart detects shifts in binary data streams quickly and reliably.

problem Early detection of small shifts in multiple binary data streams.
method Cumulative Standardized Binomial EWMA (CSB-EWMA) chart with exact variance derivation.
result Adaptive control limits ensure robust detection across different data distributions.

Enhances quantum sensing by eliminating multiple oscillations in field amplitude estimation.

problem Multiple oscillations in field amplitude estimation due to inter-qubit interactions at high qubit densities.
method Adopting a quantum circuit learning framework to approximate a target function by optimizing gate parameters.
result Elimination of multiple oscillations, leading to enhanced dynamic range of quantum sensing.

T-BFA targets and misleads specific DNN inputs to a chosen output.

problem Targeted attack on DNN weight parameters to hijack function.
method Identifies critical weight bits, ranks them by class dependence, and flips them to mislead inputs.
result Successfully misclassifies images from 'Hen' to 'Goose' class with 100% success rate, maintaining 59.35% validation accuracy.

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

Adapts randomization for single unit time-series data for optimal treatment.

problem Statistical methods for precision medicine in single unit time-series data.
method Adaptive sequential design, nonparametric model, double robust structure, efficient influence function.
result Valid inference for mean target parameter based on single sample.

Proposes a new method for estimating non-pathwise differentiable functional parameters.

problem Estimating dose-response curves for continuous exposure.
method Targeted Highly Adaptive Lasso (HAL) for non-pathwise differentiable functional parameters.
result The Targeted HAL-MLE achieves dimension-free rates up to log(n) factors and outperforms other methods in simulations.

We propose a novel unsupervised domain adaptation framework based on domain-specific batch normalization in deep neural networks. We aim to adapt to both domains by specializing batch normalization layers in convolutional neural networks while allowing them to share all other model parameters, which is realized by a tw…

2019-05-27abs ↗pdf ↗

Paper develops upper-bounds for target general loss in multiple source DA and DG settings.

problem Complexity and trade-offs in multiple source domain adaptation and domain generalization.
method Defines two types of domain-invariant representations and studies their pros, cons, and trade-offs.
result Developed upper-bounds for target general loss offer insights into domain-invariant representations.

EnMDAP aligns conditional distributions for multi-source domain adaptation using pseudolabels.

problem Training a target model with no labeled data in the absence of target data labels.
method EnMDAP uses label-wise moment matching and ensemble learning with multiple feature extractors.
result EnMDAP achieves state-of-the-art performance in multi-source domain adaptation tasks.

Due to the growing ubiquity of unlabeled data, learning with unlabeled data is attracting increasing attention in machine learning. In this paper, we propose a novel semi-supervised kernel learning method which can seamlessly combine manifold structure of unlabeled data and Regularized Least-Squares (RLS) to learn a ne…

2012-03-15abs ↗pdf ↗

Paper proposes a new method to aggregate multiple sources with different label distributions.

problem Aggregating from multiple target-shifted sources with different label distributions.
method Unified framework to select relevant sources for domain adaptation with limited label, unsupervised, and label partial unsupervised scenarios.
result Empirical results significantly outperform baselines.

Transfer learning aims to faciliate learning tasks in a label-scarce target domain by leveraging knowledge from a related source domain with plenty of labeled data. Often times we may have multiple domains with little or no labeled data as targets waiting to be solved. Most existing efforts tackle target domains separa…

2017-11-09abs ↗pdf ↗

We provide non-asymptotic excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target parameter depends on an unknown nuisance parameter that must be estimated from data. We analyze a two-stage sample splitting meta-algorithm that takes as input ar…

2019-01-25abs ↗pdf ↗

TKRR improves KRR performance by aligning target functions with kernels.

problem Improving kernel ridge regression performance through target alignment.
method Focuses on truncated kernel ridge regression (TKRR) with an additional spectral truncation parameter.
result TKRR can achieve faster rates than full KRR, reaching parametric rates.

Double descent in transfer learning explained for linear regression problems.

problem Understanding generalization errors in transferring parameters between overparameterized linear regression tasks.
method Analytical characterization of generalization error in terms of transfer learning factors.
result Generalization error follows a two-dimensional double descent trend controlled by transfer learning factors.

In target tracking, the estimation of an unknown weaving target frequency is crucial for improving the miss distance. The estimation process is commonly carried out in a Kalman framework. The objective of this paper is to examine the potential of using neural networks in target tracking applications. To that end, we pr…

2018-06-13abs ↗pdf ↗

Extends covariance estimation with multiple targets for better performance.

problem Improving covariance estimation for multiple targets.
method Combines multiple constant matrices with sample covariance matrix, derives estimators and proves convergence.
result The multi-target linear shrinkage estimator outperforms other estimators in various situations.

This paper uses MIL and MHCNN-RNN to predict precursors to aviation safety events.

problem Identifying events that precede aviation safety incidents.
method Multiple-instance learning (MIL) framework combined with a Multi-Head Convolutional Neural Network-Recurrent Neural Network (MHCNN-RNN) architecture.
result Multiple binary classifiers outperform in predicting high speed and high path angle events during the approach phase.

Many applications in signal processing require the estimation of some parameters of interest given a set of observed data. More specifically, Bayesian inference needs the computation of {\it a-posteriori} estimators which are often expressed as complicated multi-dimensional integrals. Unfortunately, analytical expressi…

2018-01-27abs ↗pdf ↗

EGMU optimizes portfolios using KL divergence, ensuring positive solutions.

problem Constructing multi-factor target-exposure portfolios efficiently and accurately.
method Convex optimization framework minimizing KL divergence, with explicit solvers.
result Established feasibility and uniqueness of strictly positive solutions under convex-hull conditions.

Policy-gradient method controls multiple non-cohesive targets.

problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.

Bayesian active learning tackles nuisance parameters, leading to bias and dilemmas.

problem Bayesian active learning with nuisance parameters leads to bias and dilemmas.
method Characterizes and mitigates negative interference by accurately estimating nuisance parameters.
result The extent of negative interference can be extremely large, and accurate estimation of nuisance parameters is critical.