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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for negative counterpart

Capsule networks can only represent symmetric functions due to routing limitations.

problem Capsule networks' expressivity is limited to symmetric functions.
method Proved and empirically demonstrated that EM-routing and routing-by-agreement prevent capsule networks from distinguishing inputs and their negative counterpart.
result Capsule networks are not universal approximators due to the limitation of expressivity.

Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph, we present an algorithm for learning word embeddings in hyperbolic space from fr…

2018-08-30abs ↗pdf ↗

We study the notion of algebraic tangent cones at singularities of reflexive sheaves. These correspond to extensions of reflexive sheaves across a negative divisor. We show the existence of optimal extensions in a constructive manner, and we prove the uniqueness in a suitable sense. The results here are an algebro-geom…

2018-08-07abs ↗pdf ↗

The paper generalizes a Steklov eigenvalue inequality for substatic triples under non-negative Ricci curvature.

problem Estimating Steklov eigenvalues for substatic triples under non-negative Ricci curvature.
method Generalization of Fraser-Li type inequality for substatic triples under non-negative Ricci curvature associated with an affine connection.
result The paper provides a new inequality for Steklov eigenvalues of substatic triples.

From only positive (P) and unlabeled (U) data, a binary classifier could be trained with PU learning, in which the state of the art is unbiased PU learning. However, if its model is very flexible, empirical risks on training data will go negative, and we will suffer from serious overfitting. In this paper, we propose a…

2017-03-02abs ↗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 introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear combination of spanning trees with negative weights. This technique is a lower-bound count…

2012-03-15abs ↗pdf ↗

Paper extends Aronson-Bénilan estimates for porous medium equations on manifolds with negative curvature.

problem Estimating gradients for porous medium equations on manifolds with negative curvature.
method Develops Aronson-Bénilan gradient estimates for porous medium equations under lower bounds of NN-weighted Ricci curvature with N<0N < 0.
result Generalizes gradient estimates for porous medium equations to manifolds with negative curvature.

Lower bound for Steklov eigenvalues on negatively curved manifolds.

problem Finding a geometric lower bound for the first nonzero Steklov eigenvalue.
method Combining a uniform lower bound for the first eigenvalue of the Steklov-Dirichlet problem and a tubular neighborhood theorem for totally geodesic hypersurfaces.
result A geometric lower bound for the first nonzero Steklov eigenvalue in terms of total and boundary volumes.

A polynomial counterpart of the Seiberg-Witten invariant associated with a negative definite plumbed 3-manifold has been proposed by earlier work of the authors. It is provided by a special decomposition of the zeta-function defined by the combinatorics of the manifold. In this article we give an algorithm, based on mu…

2017-08-03abs ↗pdf ↗

New confidence intervals improve treatment effect estimation in randomized experiments.

problem Improving confidence intervals for treatment effects in randomized experiments.
method Systematic exploitation of negative dependence or variance adaptivity.
result Achieved nonasymptotic confidence intervals with the same effective sample size as asymptotic ones.

Study of negative ads on social media during U.S. midterm elections.

problem Understanding the effectiveness and mechanisms of negative advertising on social media.
method Machine learning for sentiment analysis, AI image recognition, ordinal regressions.
result Negative ads are less effective than previously thought, anger is a key mechanism.

The non-negative solution to an underdetermined linear system can be uniquely recovered sometimes, even without imposing any additional sparsity constraints. In this paper, we derive conditions under which a unique non-negative solution for such a system can exist, based on the theory of polytopes. Furthermore, we deve…

2013-03-12abs ↗pdf ↗

This work shows MLPs can approximate monotonic functions without bounded activations.

problem Optimizing MLPs with monotonic constraints and bounded activations.
method Generalized theoretical results showing MLPs with non-negative weights and saturating activations are universal approximators.
result MLPs with non-negative weights and saturating activations are universal approximators for monotonic functions.

We define holomorphic quadratic differentials for spacelike surfaces with constant mean curvature in the Lorentzian homogeneous spaces L(κ,τ)\mathbb{L}(κ,τ) with isometry group of dimension 4, which are dual to the Abresch-Rosenberg differentials in the Riemannian counterparts E(κ,τ)\mathbb{E}(κ,τ), and obtain some consequence…

2017-08-22abs ↗pdf ↗

Paper improves Monte Carlo sampling with new theoretical insights and methods.

problem Improving Monte Carlo sampling for variance reduction.
method Theoretical analysis of negatively dependent random variables and novel extensions using number theory and particle algorithms.
result Near-Orthogonal Monte Carlo (NOMC) consistently outperforms Orthogonal Monte Carlo (OMC) in various applications.

CLuP achieves near optimal ground state energies for positive and negative Hopfield models.

problem Finding near optimal ground state energies for positive and negative Hopfield models.
method Controlled Loosening-up (CLuP) algorithm with fully lifted random duality theory (fl RDT).
result Achieves ground state free energies of 1.771.77 and 0.330.33 for positive and negative Hopfield models respectively.

The study examines Eschenburg orbifolds with positive sectional curvature and their geometric/topological properties.

problem Understanding the geometric and topological constraints of positively curved Eschenburg orbifolds.
method Proved restrictions on singular sets and computed orbifold cohomology rings.
result Distinctive behavior in cohomology groups of positively curved Eschenburg orbifolds.

Study shows virtually abelian subgroups have commensurable counterparts in mapping class groups.

problem Understanding virtually abelian subgroups in mapping class groups.
method Proving commensurability and normalizer relationships for virtually abelian subgroups.
result Upper bounds for geometric dimension of mapping class groups for abelian subgroups of bounded rank.

New method lowers spherical perceptron capacity using fully lifted random duality theory.

problem Tackles the negative spherical perceptron capacity, a long-standing open problem.
method Develops fully lifted random duality theory (fl RDT) to characterize capacity.
result Shows remarkable closed-form analytical relations for practical capacity values.

Optimal transport for measures on noisy tree metrics is solved with robust approach.

problem Optimal transport problem for measures on noisy tree metrics.
method Max-min robust optimal transport approach considering uncertainty sets of tree metrics.
result Robust optimal transport admits a closed-form expression for fast computation.

Efficiently implements MEG for low-rank matrix optimization problems.

problem Optimization over spectrahedron with low-rank matrices.
method Matrix Exponentiated Gradient (MEG) method with efficient implementations.
result Methods converge from a warm-start initialization with similar rates to full-SVD-based counterparts.

The (stochastic) gradient descent and the multiplicative update method are probably the most popular algorithms in machine learning. We introduce and study a new regularization which provides a unification of the additive and multiplicative updates. This regularization is derived from an hyperbolic analogue of the entr…

2019-02-05abs ↗pdf ↗

Market impact is reduced when orders are filled with concentrated counterparts.

problem Market impact increases with a large number of trading counterparts.
method Analyzed London Stock Exchange data to show concentrated trading impacts market price.
result Concentrated trading reduces market impact when matched with similarly concentrated counterparts.

The n-solvable filtration {Fn}n=0\{\mathcal{F}_n\}_{n=0}^\infty of the smooth knot concordance group (denoted by C\mathcal{C}), due to Cochran-Orr-Teichner, has been instrumental in the study of knot concordance in recent years. Part of its significance is due to the fact that certain geometric characterizations of a knot …

2013-09-29abs ↗pdf ↗

We define and study a family of distributions with domain complete Riemannian manifold. They are obtained by projection onto a fixed tangent space via the inverse exponential map. This construction is a popular choice in the literature for it makes it easy to generalize well known multivariate Euclidean distributions. …

2008-05-06abs ↗pdf ↗

The connection between differential geometry of curves and the (2+1)-dimensional integrable spin system - the M-III equation is established. Using the presented geometrical formalism the L-equivalent counterpart of the M-III equation is found.

1999-09-25abs ↗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.

The paper calculates involutive Heegaard Floer homology for specific 3-manifolds.

problem Calculating numerical invariants for specific 3-manifolds.
method Involutive Heegaard Floer homology techniques and spin filling constraints.
result Established new constraints and obstructions for 3-manifolds.

Deep neural networks (DNNs) are powerful nonlinear architectures that are known to be robust to random perturbations of the input. However, these models are vulnerable to adversarial perturbations--small input changes crafted explicitly to fool the model. In this paper, we ask whether a DNN can distinguish adversarial …

2017-03-01abs ↗pdf ↗

We study higher-degree generalizations of symplectic groupoids, referred to as {\em multisymplectic groupoids}. Recalling that Poisson structures may be viewed as infinitesimal counterparts of symplectic groupoids, we describe "higher'' versions of Poisson structures by identifying the infinitesimal counterparts of mul…

2013-12-22abs ↗pdf ↗

Convolutional Neural Networks, as most artificial neural networks, are commonly viewed as methods different in essence from kernel-based methods. We provide a systematic translation of Convolutional Neural Networks (ConvNets) into their kernel-based counterparts, Convolutional Kernel Networks (CKNs), and demonstrate th…

2019-03-19abs ↗pdf ↗