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

Trend · papers per month

89178267356 · Jun 202019922001200920172026
48 results for negative multiple

A new metric, Weighted Regret, unifies FDR and power evaluation in online multiple testing.

problem The asymmetric costs of false positives and false negatives in automated pipelines.
method Introducing Weighted Regret and Decoupled-OMT (DOMT) to unify FDR and power evaluation.
result DOMT achieves an order-optimal sublinear mitigation of threshold depletion in bursty environments.

A new PGA algorithm ensures stable, robust, and noise-immune solutions for non-negative inverse problems.

problem Stable convergence and suboptimal solutions in inverse problems due to negative values and high sensitivity to hyperparameters.
method A novel multiplicative update proximal gradient algorithm (SSO-PGA) that enforces non-negativity and boundedness through a learnable sigmoid-based operator.
result Significantly surpasses traditional PGA and other state-of-the-art algorithms in performance and stability.

The study shows ends of shrinking gradient ρρ-Einstein solitons are non-parabolic.

problem Characterizing the ends of shrinking gradient ρρ-Einstein solitons.
method Proving non-parabolicity of ends and connectivity at infinity for specific conditions.
result Gradient shrinking ρρ-Einstein solitons have non-parabolic ends under certain conditions.

New unsupervised method selects hard negative samples for contrastive learning.

problem How to select good negative examples for contrastive learning without using true similarity information.
method Developed a new family of unsupervised sampling methods for hard negative selection.
result Improves downstream performance across multiple modalities.

We develop a Bayesian nonparametric approach to a general family of latent class problems in which individuals can belong simultaneously to multiple classes and where each class can be exhibited multiple times by an individual. We introduce a combinatorial stochastic process known as the negative binomial process (NBP)…

2011-11-08abs ↗pdf ↗

Optimizes quickest detection of drift in Brownian motion with false negatives.

problem Quickest detection of drift in Brownian motion with false negatives.
method Formulated as an optimal multiple stopping problem, then equivalent to a recursive optimal stopping problem, solved using free boundary methods.
result Explicit formulae for expected cost and optimal strategy found.

Paper introduces negative margin loss for better few-shot classification accuracy.

problem Improving few-shot classification accuracy with metric learning.
method Introduces negative margin loss and analyzes its impact on feature discriminability.
result Negative margin loss outperforms regular softmax loss on few-shot classification benchmarks.

Spectral Clustering is a popular technique to split data points into groups, especially for complex datasets. The algorithms in the Spectral Clustering family typically consist of multiple separate stages (such as similarity matrix construction, low-dimensional embedding, and K-Means clustering as post processing), whi…

2019-11-01abs ↗pdf ↗

Factorial moments are convenient tools in particle physics to characterize the multiplicity distributions when phase-space resolution (ΔΔ) becomes small. They include all correlations within the system of particles and represent integral characteristics of any correlation between these particles. In this letter, we sh…

2011-08-30abs ↗pdf ↗

New algorithm provably converges to second-order stationary points in NMF.

problem Understanding convergence to local minima in NMF.
method Multiplicative weight update dynamics, concurrent updates, and simplex reduction.
result Provable convergence to second-order stationary points.

RSIC identifies multiple ranks of interest in NMF by analyzing residual sensitivity.

problem Determining the optimal rank in NMF.
method RSIC analyzes sensitivity of relative residuals to different initializations.
result RSIC identifies meaningful ranks consistent with data structure.

Paper reformulates UOT as non-negative penalized linear regression for efficient algorithms.

problem Optimal transport with relaxed marginal conditions.
method Reformulate UOT as non-negative penalized linear regression, propose multiplicative updates.
result Efficient algorithms for UOT with quadratic penalties, continuity of solutions.

New scalable algorithm for non-negative linear regression with entropy-regularized OT loss.

problem Generalizing task-specific linear models to broader applications.
method Sinkhorn-like scaling iterations for convex penalty and datafit terms.
result Simple multiplicative updates for various penalty and datafit terms.

Networks have been a general tool for representing, analyzing, and modeling relational data arising in several domains. One of the most important aspect of network analysis is community detection or network clustering. Until recently, the major focus have been on discovering community structure in single (i.e., monople…

2016-12-01abs ↗pdf ↗

Goldman (Invent. Math. 85(2) (1986) 263) and Turaev (Ann. Sci. Ecole Norm. Sup. (4) 24 (6)(1991) 635) found a Lie bialgebra structure on the vector space generated by non-trivial free homotopy classes of loops on an orientable surface. Chas (Combinatorial Lie bialgebras of curves on surfaces, Topology 43 (2004) 543), b…

2005-10-30abs ↗pdf ↗

Paper introduces SMM for forecasting multiple time series with missing values.

problem Forecasting multiple time series with missing and noisy values.
method Sliding Mask Method (SMM) using Non-negative Matrix Factorization (NMF).
result The method outperforms state-of-the-art methods in time series forecasting.

Study shows surfaces with similar length spectra are smoothly deformable.

problem Quantifying how similar the length spectra of two negatively curved surfaces are.
method Analyzes marked length spectra of closed negatively curved surfaces and proves smooth deformations.
result Smooth diffeomorphisms exist between surfaces with close length spectra.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗

Paper proposes a method to identify negative transfers in multitask learning using surrogate models.

problem Identifying subsets of source tasks that improve target task performance in multitask learning.
method Surrogate modeling to precompute multitask learning performances and approximate them with a linear regression model.
result The approach predicts negative transfers from multiple source tasks to target tasks more accurately than existing methods.

Improves key instance detection in MIL models by using neural network inversion with sparseness constraint.

problem Limited key instance detection performance in attention-based deep MIL models due to skewed attention scores.
method Sparse network inversion with a sparseness constraint incorporated into neural network inversion, solved by proximal gradient method.
result Significantly improved key instance detection performance while maintaining bag-level prediction performance.

Study reveals structure of local minima in GMMs, identifying key cluster centers.

problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.

We introduce the concept of "negative bubbles" as the mirror image of standard financial bubbles, in which positive feedback mechanisms may lead to transient accelerating price falls. To model these negative bubbles, we adapt the Johansen-Ledoit-Sornette (JLS) model of rational expectation bubbles with a hazard rate de…

2010-03-30abs ↗pdf ↗

In this paper we investigate the performance of different types of rectified activation functions in convolutional neural network: standard rectified linear unit (ReLU), leaky rectified linear unit (Leaky ReLU), parametric rectified linear unit (PReLU) and a new randomized leaky rectified linear units (RReLU). We evalu…

2015-05-05abs ↗pdf ↗

We present a riemannian structure on the disk that has a remarkably rich structure. Geodesics are hypocycloids and the (negative of the) laplacian has integer spectrum with multiplicity the Dirichlet divisor function. Eigenfunctions of the laplacian are orthogonal polynomials naturally suited to the analysis of acousti…

2016-03-21abs ↗pdf ↗

New method for inference on covariates in NMF with random effects.

problem Formal inference for covariate effects in NMF with non-negativity constraints.
method NMF-RE model with random effects, ridge updates, df-based cap, asymptotic linearization, wild bootstrap.
result Valid inference on covariates with non-negativity constraint, avoiding degeneracy.

New method improves weakly-supervised action localization.

problem Locating action segments in videos with limited labels.
method Explicitly models key instance assignment as hidden variable using EM framework.
result Achieves state-of-the-art performance on THUMOS14 and ActivityNet1.2 benchmarks.

We introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson matrix factorization (PF) perturbed by a multiplicative term which models exposure. This term brings a degree of freedom fo…

2018-01-05abs ↗pdf ↗

Motivated by applications in hyperspectral imaging we investigate methods for approximating a high-dimensional non-negative matrix Y\mathbf{\mathit{Y}} by a product of two lower-dimensional, non-negative matrices K\mathbf{\mathit{K}} and X.\mathbf{\mathit{X}}. This so-called non-negative matrix factorization is based…

2018-08-06abs ↗pdf ↗

We describe a novel weakly supervised deep learning framework that combines both the discriminative and generative models to learn meaningful representation in the multiple instance learning (MIL) setting. MIL is a weakly supervised learning problem where labels are associated with groups of instances (referred as bags…

2018-07-06abs ↗pdf ↗

We present a binary code for spinors and Clifford multiplication using non-negative integers and their binary expressions, which can be easily implemented in computer programs for explicit calculations. As applications, we present explicit descriptions of the triality automorphism of Spin(8)Spin(8), explicit representations…

2019-05-25abs ↗pdf ↗