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

5099149198 · Jun 202019922001200920172026
48 results for partial concepts

PCBM improves neural network generalization by partially observing concepts.

problem Decreased generalization performance due to observing all concepts in CBM.
method Developed a theoretical analysis of PCBM's Bayesian generalization error.
result PCBM's generalization error is lower than CBM's due to partial concept observation.

Study expands multiclass classification models with new rates and partial concept classes.

problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.

New concept of partial law invariance connects decision theory and financial risk management.

problem Connecting decision theory and financial risk management under uncertainty.
method Characterizing partially law-invariant coherent risk measures via a novel representation formula.
result Strong partial law invariance bridges the gap between existing risk measure representations.

New concept of partial comonotonicity connects riskmetrics and dependence.

problem Understanding and quantifying risk metrics under partial comonotonicity.
method Developed a new notion of partial comonotonicity and established its connection to distortion riskmetrics.
result Partial comonotonicity uniquely characterizes a class of distortion riskmetrics through additivity.

Research on mixed polynomials, extending non-degeneracy concepts to complex variables.

problem Extending non-degeneracy concepts to mixed polynomials in complex variables.
method Generalization of Mondal's partial non-degeneracy to mixed polynomials, introducing new concepts and proving properties.
result Strong partial non-degeneracy implies isolated singularities, and mixed polynomials that are strongly inner non-degenerate satisfy the strong Milnor condition.

In this review paper we discuss the different interpretations of the concept of connection in a fiber bundle and in a jet bundle, and relate it with first and second-order systems of partial differential equations (PDE's) and multivector fields. As particular cases we analyze the concepts of linear connections and conn…

2018-03-28abs ↗pdf ↗

PDD detects concept drift using explainable AI, improving model performance in dynamic environments.

problem Detecting and adapting to concept drift in predictive models.
method Profile Drift Detection (PDD) using Partial Dependence Profiles (PDPs).
result PDD outperforms existing methods in detecting concept drift and maintaining high predictive performance.

CREAM models enable concept-grounded predictions and interpretability.

problem Designing models that can encode and extend prior knowledge about concept-concept and concept-task relationships.
method Proposes a flexible and efficient framework (CREAMs) that encodes arbitrary CCC-C and CoYC o Y relationships, incorporating a side-channel for incomplete concept sets.
result CREAM models achieve competitive task performance while encouraging concept-grounded predictions, avoiding concept leakage and achieving black-box-level performance.

We introduce the concept of partial Poisson structure on a manifold MM modelled on a convenient space. This is done by specifying a (weak) subbundle TMT^{\prime}M of TMT^{\ast}M and an antisymmetric morphism P:TMTMP:T^{\prime}M\rightarrow TM such that the bracket {f,g}P=<df,P(dg)>\{f,g\}_{P}=-<df,P(dg)> defines a Poisson bracket on the …

2018-08-08abs ↗pdf ↗

The study explores polarized deformations of SKT Calabi-Yau manifolds using Aeppli classes.

problem Understanding polarized deformations of SKT Calabi-Yau manifolds.
method Introducing small deformations polarized by Aeppli classes and investigating their properties.
result Existence of primitive elements in Bott-Chern classes and metrics comparison.

This work proves DP learnability implies online learnability for general classification tasks.

problem Link between differential privacy and online learning for general classification tasks.
method Establishes Ramsey-type theorems for trees to prove DP learnability implies online learnability.
result DP learnability implies online learnability for general classification tasks.

We use partial class memberships in soft classification to model uncertain labelling and mixtures of classes. Partial class memberships are not restricted to predictions, but may also occur in reference labels (ground truth, gold standard diagnosis) for training and validation data. Classifier performance is usually ex…

2013-01-02abs ↗pdf ↗

Holomorphic maps are a special case of Hermitian pluriharmonic maps between almost Hermitian manifolds.

problem Characterizing maps between almost Hermitian manifolds.
method Introducing Hermitian pluriharmonic maps and proving their properties.
result Holomorphic or anti-holomorphic maps are Hermitian pluriharmonic.

The paper reviews and extends calibration concepts for classification and regression.

problem Formalizing compatibility between probabilistic predictions and outcomes.
method Review and extension of existing calibration concepts, introduction of new concepts.
result Hierarchical relations between calibration concepts for various data types.

Quantum probability theory reveals hidden structure in joint probability distributions.

problem Understanding hidden structure in joint probability distributions.
method Modeling joint probability distributions as density operators and applying partial trace.
result Decoding extra information in reduced density operators that captures subsystem interactions.

CPPO learns policies from partial offline data in MDPs with structural assumptions.

problem Offline Reinforcement Learning with partial coverage assumption.
method Constrained Pessimistic Policy Optimization (CPPO) using a function class and model class constraint.
result CPPO achieves PAC guarantee with partial coverage, learning competitive policies.

Concept drift is formally defined as the change in joint distribution of a set of input variables X and a target variable y. The two types of drift that are extensively studied are real drift and virtual drift where the former is the change in posterior probabilities p(y|X) while the latter is the change in distributio…

2019-09-25abs ↗pdf ↗

The paper explores how semantic independence can be captured in text embeddings using partial orthogonality.

problem Capturing semantic independence in text embeddings.
method Developed a theory and methods based on partial orthogonality to demonstrate semantic independence.
result Partial orthogonality captures semantic independence in text embeddings.

Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts

problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios

Classifiers operating in a dynamic, real world environment, are vulnerable to adversarial activity, which causes the data distribution to change over time. These changes are traditionally referred to as concept drift, and several approaches have been developed in literature to deal with the problem of drift handling an…

2018-03-24abs ↗pdf ↗

Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over graphs or networks. In this paper, we generalize the traditional concept of wide …

2016-01-11abs ↗pdf ↗

Proves surjectivity of certain smooth maps with non-properness sets.

problem Surjectivity of linear operators and global diffeomorphisms of semialgebraic maps.
method Analytic proof involving CC^{\infty} semialgebraic local diffeomorphisms and linear partial differential operators.
result A new analytic conjecture for polynomial local diffeomorphisms of RnR^n implies known results.

Survey explores cohomology's roles in applied math and sciences.

problem Understanding cohomology's role in solving differential equations.
method Examining differential complexes and structure-preserving discretizations.
result Various fundamental concepts in mechanics are formulated using differential complexes.

The paper introduces a new measure of robustness for partially identifiable risks.

problem Achieving robustness when the robust risk is only partially identified.
method Introduces the worst-case robust risk and evaluates existing methods.
result Existing robustness methods are suboptimal in the partially identifiable case.

We extend the concept of renormalized volume for geometrically finite hyperbolic 33-manifolds, and show that is continuous for geometrically convergent sequences of hyperbolic structures over an acylindrical 3-manifold MM with geometrically finite limit. This allows us to show that the renormalized volume attains its…

2016-05-25abs ↗pdf ↗

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a…

2003-05-10abs ↗pdf ↗

In this paper we investigate the existence of ``partially'' isometric immersions. These are maps f:M->R^q which, for a given Riemannian manifold M, are isometries on some sub-bundle H of TM. The concept of free maps, which is essential in the Nash--Gromov theory of isometric immersions, is replaced here by that of H-fr…

2010-07-18abs ↗pdf ↗

Stochastic computation graphs (SCGs) provide a formalism to represent structured optimization problems arising in artificial intelligence, including supervised, unsupervised, and reinforcement learning. Previous work has shown that an unbiased estimator of the gradient of the expected loss of SCGs can be derived from a…

2019-01-07abs ↗pdf ↗

Reinterprets Schrödinger equation using Cartan connection for geometric investigation.

problem Investigating the geometry of the space for Schrödinger equation solutions.
method Constructs Cartan connection from scaling Lie-Bäcklund group on jet space.
result Demonstrates a new geometric approach to Schrödinger equation.