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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for negative regularization

Study optimal ridge regularization for out-of-distribution prediction.

problem Optimal ridge regularization for predicting out-of-distribution data.
method Established conditions for optimal regularization under covariate and regression shifts, proving monotonic risk in data aspect ratio.
result Negative regularization can be optimal under shifts, even with isotropic or underparameterized training features.

Bayesian Markowitz portfolio problem shows entropy regularization is ineffective.

problem Entropy regularization in Bayesian Markowitz portfolio optimization.
method Combines continuous-time Bayesian filtering with stochastic policy optimization.
result Entropy regularization does not accelerate learning of unknown drift.

Study proves solenoidal injectivity for tensor fields on curved manifolds with low regularity.

problem Injectivity for tensor fields on negatively curved manifolds with low regularity metrics.
method Pestov energy estimates for transport equation on non-smooth unit sphere bundle, keeping track of regularity, and using functions with more vertical than horizontal regularity.
result Proves solenoidal injectivity for tensor fields on simple Riemannian manifolds with C1,1C^{1,1} metrics and non-positive sectional curvature.

Regularized training of an autoencoder typically results in hidden unit biases that take on large negative values. We show that negative biases are a natural result of using a hidden layer whose responsibility is to both represent the input data and act as a selection mechanism that ensures sparsity of the representati…

2014-02-13abs ↗pdf ↗

An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to 2π/32π/3 is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of closed local minimal nets on surfaces of constant negative curvature has been for…

1998-07-13abs ↗pdf ↗

New method for comparing different mass measures on tree structures using entropy partial transport.

problem Comparing nonnegative measures with different masses on tree structures.
method Entropy Partial Transport (EPT) on extended trees, regularized for fast computation and negative definiteness.
result First closed-form solution for unbalanced OT on tree structures.

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.

SOS programming verifies MTW tensor non-negativity for optimal transport maps.

problem Verifying MTW tensor non-negativity for general cost functions is difficult.
method Sum-of-Squares (SOS) programming for verifying and approximating MTW non-negativity.
result SOS programming provides certificates and approximations of MTW non-negativity.

FTRL algorithm with negative entropy regularizer achieves best-of-three-world results for linear bandits.

problem Designing an FTRL algorithm for linear bandits with optimal regret bounds.
method Follow-the-regularized-leader (FTRL) algorithm with negative entropy regularizer.
result Regret bounds achieve the same or nearly the same order as detect-switch type algorithm but with simpler design.

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.

This work shows dimension regularization can replace skip-gram negative sampling for graph embeddings, improving efficiency and performance.

problem Efficiently enforcing dissimilarity among node embeddings in graph learning.
method Dimension regularization as an alternative to skip-gram negative sampling.
result Dimension regularization is a more efficient approach to enforcing dissimilarity in graph embeddings.

New method improves source separation using NMF and adversarial learning.

problem Source separation in single channel data.
method Maximum Discrepancy Generative Regularization applied to NMF.
result Improvement in reconstructed signals, especially in weak supervision scenarios.

This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to Bregman divergences. Our framework thus naturally generalizes a previously proposed …

2016-10-20abs ↗pdf ↗

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 ↗

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.

We show that the positive mass theorem holds for continuous Riemannian metrics that lie in the Sobolev space Wloc2,n/2W^{2, n/2}_{loc} for manifolds of dimension less than or equal to 77 or spin-manifolds of any dimension. More generally, we give a (negative) lower bound on the ADM mass of metrics for which the scalar curvat…

2014-08-27abs ↗pdf ↗

Study interpolating estimators for causal learning from observational data.

problem Learning causal models from observational data in complex model classes.
method Investigate min-norm interpolators and ridge-regularized regressors in a linearly confounded model.
result Interpolators cannot be optimal for causal learning under the principle of independent causal mechanisms, requiring stronger regularization.

A new method for PU learning improves classification error on CIFAR-10.

problem Learning from positive and unlabeled data in practical applications.
method A simple yet effective data augmentation method based on consistency regularization.
result Achieves an averaged improvement of 3.40 points in classification error on CIFAR-10.

The paper proves finite topological type theorems for open manifolds with non-negative Ricci curvature and almost maximal local rewinding volume.

problem Proving finite topological type theorems for open manifolds with non-negative Ricci curvature and almost maximal local rewinding volume.
method The approach removes constraints of sectional curvature or conjugate radius and extends to previous related studies.
result Theorems are proven for open manifolds with non-negative Ricci curvature and almost maximal local rewinding volume, without the need for triangle comparison of Toponogov type.

We revisit skip-gram negative sampling (SGNS), one of the most popular neural-network based approaches to learning distributed word representation. We first point out the ambiguity issue undermining the SGNS model, in the sense that the word vectors can be entirely distorted without changing the objective value. To res…

2018-04-01abs ↗pdf ↗

Study properties of solutions with singularities in the negative cone.

problem Properties of solutions with singularities in the negative cone.
method Proved PDE for trace and normal derivatives, showed hypersurface is minimal for k=2.
result Hypersurface is minimal for k=2 and satisfies certain PDE.

The study addresses negative transfer in multi-output Gaussian processes by proposing latent structures.

problem Negative transfer in multi-output Gaussian processes leading to decreased performance.
method Defining negative transfer, deriving conditions for avoiding it, proposing latent structures.
result Latent structures can avoid negative transfer and scale to large datasets.

In this paper, complex Hessian equation over Kähler manifold was studied. Under the condition that the underline Kähler manifold has non-negative holomorphic bisectional curvature, the existence and regularity of the solution was proved.

2008-12-24abs ↗pdf ↗

In this paper, we compare Ollivier Ricci curvature and Bakry-Émery curvature notions on combinatorial graphs and discuss connections to various types of Ricci flatness. We show that non-negativity of Ollivier Ricci curvature implies non-negativity of Bakry-Émery curvature under triangle-freeness and an additional in-de…

2019-09-25abs ↗pdf ↗

ReLU networks implicitly favor low-rank solutions, but not as strongly as linear networks.

problem Understanding implicit regularization in ReLU networks for rank minimization.
method Analysis of gradient flow on ReLU networks, empirical testing.
result Gradient flow on ReLU networks does not necessarily minimize ranks, unlike in linear networks.

The fused lasso penalizes a loss function by the L1L_1 norm for both the regression coefficients and their successive differences to encourage sparsity of both. In this paper, we propose a Bayesian generalized fused lasso modeling based on a normal-exponential-gamma (NEG) prior distribution. The NEG prior is assumed in…

2016-02-16abs ↗pdf ↗

New approach to portfolio optimization shows entropy regularization is ineffective.

problem Entropy regularization in mean-variance portfolio optimization under drift uncertainty.
method Combining Bayesian filtering and stochastic policy optimization.
result Entropy regularization does not accelerate learning about unknown drift.

A common challenge in estimating parameters of probability density functions is the intractability of the normalizing constant. While in such cases maximum likelihood estimation may be implemented using numerical integration, the approach becomes computationally intensive. The score matching method of Hyvärinen [2005] …

2018-12-26abs ↗pdf ↗