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

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for complementary operating conditions

Framework transfers complementary operating conditions to train anomaly detectors.

problem Training anomaly detectors on changing operating conditions requires comprehensive data, which is hard to obtain.
method Proposes unsupervised transfer learning to align and combine data from different units.
result Demonstrates improved anomaly detection in changing operating conditions.

Majority of state-of-the-art deep learning methods are discriminative approaches, which model the conditional distribution of labels given inputs features. The success of such approaches heavily depends on high-quality labeled instances, which are not easy to obtain, especially as the number of candidate classes increa…

2019-04-02abs ↗pdf ↗

The functional determinant of an elliptic operator with positive, discrete spectrum may be defined as eZ(0)e^{-Z'(0)}, where Z(s)Z(s), the zeta function, is the sum nλns\sum_n^{\infty} λ_n^{-s} analytically continued to ss around the origin. In this paper Z(0)Z'(0) is calculated for the Laplace operator with Dirichlet boundary…

1993-04-08abs ↗pdf ↗

Upper bounds for second Robin eigenvalue on Riemannian surfaces.

problem Bounding the second Robin eigenvalue of Schrödinger operators on Riemannian surfaces.
method Geometric upper bound via Hersch balancing argument on capped surfaces.
result Sharp geometric restrictions for minimal surfaces in negatively curved manifolds.

Collecting labeled data is costly and thus a critical bottleneck in real-world classification tasks. To mitigate this problem, we propose a novel setting, namely learning from complementary labels for multi-class classification. A complementary label specifies a class that a pattern does not belong to. Collecting compl…

2017-05-22abs ↗pdf ↗

Researchers compute Wodzicki residue for pseudo-differential operators on compact Lie groups.

problem Computing the Wodzicki residue for pseudo-differential operators on compact Lie groups.
method Analytic continuation of traces and matrix-valued symbols.
result Main theorem complementary to [2], removing ellipticity hypothesis.

Paper proposes a method to adapt classifiers using complementary labels instead of true labels.

problem Training classifiers with true labels from the source domain is costly and sometimes impossible.
method Proposes a novel setting with complementary labels and a complementary label adversarial network (CLARINET).
result CLARINET significantly outperforms baselines on handwritten digits and object recognition tasks.

We propose a Hodge theory for the spaces E2p,qE_2^{p,\,q} featuring at the second step either in the Frölicher spectral sequence of an arbitrary compact complex manifold XX or in the spectral sequence associated with a pair (N,F)(N,\,F) of complementary regular holomorphic foliations on such a manifold. The main idea is to …

2016-01-19abs ↗pdf ↗

Three RFF-based methods for nonlinear causal discovery in mixed data.

problem Nonlinear causal discovery in mixed data with computational constraints.
method FFML, TRFF, and FFCI methods for score-based, constraint-based, and hybrid causal discovery.
result FFML and TRFF methods provide complementary performance in causal discovery.

We establish the existence of analytic curves of eigenvalues for the Laplace-Neumann operator through an analytic variation of the metric of a compact Riemannian manifold MM with boundary by means of a new approach rather than Kato's method for unbounded operators. We obtain an expression for the derivative of the cur…

2015-10-23abs ↗pdf ↗

Two adaptive kernel selection methods improve the accuracy of Kernelized Diffusion Maps.

problem Selecting an appropriate kernel for Kernelized Diffusion Maps.
method Two complementary approaches: variational outer loop and unsupervised cross-validation.
result Both methods improve the quality and stability of the recovered eigenfunctions.

We prove Gray--Moser stability theorems for complementary pairs of forms of constant class defining symplectic pairs, contact-symplectic pairs and contact pairs. We also consider the case of contact-symplectic and contact-contact structures, in which the constant class condition on a one-form is replaced by the conditi…

2004-07-26abs ↗pdf ↗

In this paper, we study the classification problem in which we have access to easily obtainable surrogate for true labels, namely complementary labels, which specify classes that observations do \textbf{not} belong to. Let YY and Yˉ\bar{Y} be the true and complementary labels, respectively. We first model the annotati…

2017-11-27abs ↗pdf ↗

Paper bridges ordinary-label and complementary-label learning frameworks.

problem Combining complementary-label learning with ordinary-label learning.
method Integrates loss functions for one-versus-all and pairwise classification.
result Derives classification risk and error bound for additivity and duality loss functions.

Proposes a method for multi-view clustering that integrates consistent and complementary graph regularizers.

problem Multi-view clustering where views have both consistent and complementary information.
method Consistent and complementary graph-regularized multi-view subspace clustering (GRMSC).
result The proposed method outperforms state-of-the-art methods on benchmark datasets.

We propose a novel learning framework to answer questions such as "if a user is purchasing a shirt, what other items will (s)he need with the shirt?" Our framework learns distributed representations for items from available textual data, with the learned representations representing items in a latent space expressing f…

2019-08-26abs ↗pdf ↗

Learning product representations that reflect complementary relationship plays a central role in e-commerce recommender system. In the absence of the product relationships graph, which existing methods rely on, there is a need to detect the complementary relationships directly from noisy and sparse customer purchase ac…

2019-03-16abs ↗pdf ↗

In this note we study the Seifert rational homology spheres with two complementary legs, i.e. with a pair of invariants whose fractions add up to one. We give a complete classification of the Seifert manifolds with 3 exceptional fibers and two complementary legs which bound rational homology balls. The result translate…

2017-01-08abs ↗pdf ↗

We found in 2016 a few results on the mathematical structure of the conformal Killing differential sequence in arbitrary dimension nn, in particular the rank and order changes of the successive differential operators for n=3,n=4n=3,n=4 or n5n\geq 5. They were so striking that we did not dare to publish them before our form…

2018-07-22abs ↗pdf ↗

Clarinet uses complementary labels to train classifiers with less source data.

problem Training classifiers with true-label data from source domain is costly.
method Proposes CLARINET to train classifiers with complementary-label source data and unlabeled target data.
result CLARINET significantly outperforms baselines in unsupervised domain adaptation.

Complementary products recommendation is an important problem in e-commerce. Such recommendations increase the average order price and the number of products in baskets. Complementary products are typically inferred from basket data. In this study, we propose the BB2vec model. The BB2vec model learns vector representat…

2018-09-25abs ↗pdf ↗

Feature selection has attracted significant attention in data mining and machine learning in the past decades. Many existing feature selection methods eliminate redundancy by measuring pairwise inter-correlation of features, whereas the complementariness of features and higher inter-correlation among more than two feat…

2015-02-01abs ↗pdf ↗

UREs lead to overfitting in complex models, especially in complementary label learning.

problem Overfitting in weakly supervised learning with complementary labels.
method Proposed a surrogate complementary loss (SCL) framework to reduce gradient variance.
result SCL mitigates overfitting and improves URE-based methods.

New framework uses OR to ensure AI systems make safe decisions.

problem Ensuring generative AI systems make safe decisions as they gain autonomy.
method Developed a conceptual framework combining flow-based models and adversarial robustness.
result Increased autonomy requires new OR approaches for feasibility, robustness, and stress testing.

There has been much recent, exciting work on combining the complementary strengths of latent variable models and deep learning. Latent variable modeling makes it easy to explicitly specify model constraints through conditional independence properties, while deep learning makes it possible to parameterize these conditio…

2018-12-17abs ↗pdf ↗

In contrast to the standard classification paradigm where the true class is given to each training pattern, complementary-label learning only uses training patterns each equipped with a complementary label, which only specifies one of the classes that the pattern does not belong to. The goal of this paper is to derive …

2018-10-10abs ↗pdf ↗

Global constraints and reranking have not been used in cognates detection research to date. We propose methods for using global constraints by performing rescoring of the score matrices produced by state of the art cognates detection systems. Using global constraints to perform rescoring is complementary to state of th…

2017-04-24abs ↗pdf ↗

Transformers reduce redundancy by focusing on invariant relational quantities.

problem Substantial internal redundancy in Transformer models due to coordinate-dependent representations and continuous symmetries.
method Reformulate representations, attention mechanisms, and optimization dynamics in terms of invariant relational quantities, eliminating redundant degrees of freedom by construction.
result Architectures that operate directly on relational structures, providing a principled geometric framework for reducing parameter redundancy and analyzing optimization.

New research sets the minimax lower bound for KSD estimation at sqrt(n).

problem Estimating goodness-of-fit using Kernel Stein Discrepancy (KSD) on high-dimensional spaces.
method Two complementary results proving the minimax lower bound of KSD estimation.
result The minimax lower bound of KSD estimation is n^(-1/2), indicating exponential difficulty with dimensionality.

We consider the classical optimal dividends problem under the Cramér-Lundberg model with exponential claim sizes subject to a constraint on the time of ruin. We introduce the dual problem and show that the complementary slackness conditions are satisfied, thus there is no duality gap. Therefore the optimal value functi…

2014-10-14abs ↗pdf ↗

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.