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

57114171228 · Jun 202619922001200920172026
48 results for OC manifold

The study constructs Yamabe operators on OC manifolds and proves their properties.

problem Investigating Yamabe operators on OC manifolds and their invariants.
method Construction and analysis of OC Yamabe operators, transformation formula proof, Green function construction.
result Yamabe operators on OC manifolds have specific scalar positivity properties.

The paper analyzes risk estimation methods and derives bounds for OCE risk.

problem Estimating the Optimized Certainty Equivalent (OCE) risk from samples.
method Derives mean-squared error and concentration bounds for SAA of OCE, and analyzes an efficient stochastic approximation-based estimator.
result Finite sample bounds and mis-identification probability bounds for the efficient estimator.

We propose a one-class neural network (OC-NN) model to detect anomalies in complex data sets. OC-NN combines the ability of deep networks to extract a progressively rich representation of data with the one-class objective of creating a tight envelope around normal data. The OC-NN approach breaks new ground for the foll…

2018-02-18abs ↗pdf ↗

The paper studies risk-sensitive learning schemes and provides learning bounds for empirical OCE minimizers.

problem Risk-sensitive learning aims to minimize risk-averse measures of loss.
method Proposes learning bounds for empirical OCE minimizers based on Rademacher average and variance.
result Provides two learning bounds on the performance of empirical OCE minimizers.

P-OCS detects OOD samples in a low-dimensional subspace, outperforming existing methods.

problem Efficient OOD detection for deep learning models in open-world environments.
method P-OCS operates in the orthogonal complement of the principal subspace, applying a single projected perturbation.
result P-OCS achieves state-of-the-art OOD detection with negligible computational cost and without requiring model retraining.

Optimized portfolio management with dynamic market regimes using RL and OC learning.

problem Mean-Variance portfolio optimization in a regime-switching market.
method Reinforcement learning (RL) with Orthogonality Condition (OC) learning for regime-switching market dynamics.
result OC learning outperforms TD learning in simulated and real market scenarios, leading to better portfolio performance.

New method for dynamic valuation in markets with random endowments.

problem Dynamic valuation in markets with random endowments.
method Developed new FBSDE systems and established optimality conditions.
result Established necessary and sufficient conditions for optimality.

This work models GHG offset credit markets to find optimal strategies for market participants.

problem Optimizing GHG offset credit markets to reduce emissions and penalize excess emissions.
method Characterized optimal behavior in single-player and two-player GHG offset credit markets using optimal stopping and control problems, and mixed-Nash equilibria.
result Market participants benefit from optimal OC trading and generation, highlighting the importance of acting optimally.

Optimized certainty equivalents (OCEs) is a family of risk measures widely used by both practitioners and academics. This is mostly due to its tractability and the fact that it encompasses important examples, including entropic risk measures and average value at risk. In this work we consider stochastic optimal control…

2020-01-27abs ↗pdf ↗

Bayesian neural network (BNN) priors are defined in parameter space, making it hard to encode prior knowledge expressed in function space. We formulate a prior that incorporates functional constraints about what the output can or cannot be in regions of the input space. Output-Constrained BNNs (OC-BNN) represent an int…

2019-05-15abs ↗pdf ↗

Computes invariants distinguishing between immersions and embeddings of doodles and blobs on surfaces.

problem Distinguishing between immersions and embeddings of doodles and blobs on surfaces.
method Regular embeddings, bordisms, and exact sequences of abelian groups.
result Exact sequence describing bordisms of immersions and embeddings of doodles on A=RimesIA = \mathbb R imes I.

The one-class kernel spectral regression (OC-KSR), the regression-based formulation of the kernel null-space approach has been found to be an effective Fisher criterion-based methodology for one-class classification (OCC), achieving state-of-the-art performance in one-class classification while providing relatively hig…

2019-05-22abs ↗pdf ↗

This note reviews some of the recent work on biharmonic conformal maps (see \cite{OC}, Chapter 11, for a detailed survey). It will be focused on biharmonic conformal immersions and biharmonic conformal maps between manifolds of the same dimension and their links to isoparametric functions and Yamabe type equations, tho…

2019-09-10abs ↗pdf ↗

Study risk-sensitive reinforcement learning with optimized certainty equivalents.

problem Risk-sensitive reinforcement learning in finite discounted MDPs.
method Analyzed a simple model-based approach and derived PAC sample complexity bounds.
result Established tight sample complexity bounds for value and policy learning.

Online method selects candidates from data streams, ensuring irreversible decisions.

problem Conformal selection's incompatibility with irreversible decisions in online scenarios.
method Online Conformal Selection with Accept-to-Reject Changes (OCS-ARC) incorporating online Benjamini-Hochberg procedure.
result OCS-ARC controls FDR at or below nominal level, improving selection power.

EggNet reconstructs particle tracks from hits using evolving graph attention networks.

problem Particle track reconstruction is computationally expensive and combinatorial.
method EggNet uses a one-shot object condensation approach with evolving graph attention networks.
result EggNet outperforms methods requiring fixed input graphs on TrackML dataset.

The kernel null-space technique and its regression-based formulation (called one-class kernel spectral regression, a.k.a. OC-KSR) is known to be an effective and computationally attractive one-class classification framework. Despite its outstanding performance, the applicability of kernel null-space method is limited d…

2019-02-06abs ↗pdf ↗

We provide single-model estimates of aleatoric and epistemic uncertainty for deep neural networks. To estimate aleatoric uncertainty, we propose Simultaneous Quantile Regression (SQR), a loss function to learn all the conditional quantiles of a given target variable. These quantiles can be used to compute well-calibrat…

2018-11-02abs ↗pdf ↗

Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.

problem Criterion collapse in optimization, focusing on error probability minimizers.
method Analyzes various learning criteria, including DRO, OCE risks, and non-monotonic criteria.
result Non-monotonic criteria can avoid collapse, while monotonic ones cannot.

Study explores reinforcement learning in a complex game environment, analyzing rule inference and policy learning.

problem Learning optimal policies in environments with hidden rules.
method Investigated using the Game Of Hidden Rules (GOHR) environment, employing Feature-Centric and Object-Centric state representations with a Transformer-based A2C algorithm.
result Transformer-based A2C models outperform traditional methods in GOHR, demonstrating the effectiveness of representation strategies.

This study improves tail risk forecasting by integrating overnight information into semi-parametric models.

problem Improving tail risk forecasting in financial markets.
method Proposes RES-CAViaR-oc models combining overnight return and realized volatility, using Bayesian estimation.
result Realized volatility and overnight return significantly improve tail risk forecasting.

We introduce and study a novel model-selection strategy for Bayesian learning, based on optimal transport, along with its associated predictive posterior law: the Wasserstein population barycenter of the posterior law over models. We first show how this estimator, termed Bayesian Wasserstein barycenter (BWB), arises na…

2018-05-28abs ↗pdf ↗

Godin introduced the categories of open closed fat graphs FatocFat^{oc} and admissible fat graphs FatadFat^{ad} as models of the mapping class group of open closed cobordism. We use the contractibility of the arc complex to give a new proof of Godin's result that FatadFat^{ad} is a model of the mapping class group of open-close…

2015-08-14abs ↗pdf ↗

This study predicts ovarian cancer from cysts using TVUS and machine learning.

problem Early detection of ovarian cancer from cysts using TVUS screening.
method Employed Random Forest, KNN, and XGBoost machine learning techniques on PLCO dataset.
result Achieved high accuracy, recall, f1 score, and precision in predicting ovarian cancer.

New findings show many popular bandit algorithms are unstable, contradicting minimax optimality.

problem Challenges in statistical inference from bandit algorithms due to adaptive, non-i.i.d. nature.
method Analysis of stability properties of optimism-based bandit algorithms.
result Widely used minimax-optimal UCB-style algorithms are unstable.

Given a matrix ARn×dA\in \mathbb{R}^{n\times d} and a vector bRnb\in \mathbb{R}^n, we consider the regression problem with \ell_\infty guarantees: finding a vector xRdx'\in \mathbb{R}^d such that xxεdAxb2A \|x'-x^*\|_\infty \leq \fracε{\sqrt{d}}\cdot \|Ax^*-b\|_2\cdot \|A^\dagger\| where $x^*=\arg\min_{x\in \mathbb{R}^d}\|Ax-b\|…

2023-02-01abs ↗pdf ↗

In 1972, K. Kenmotsu studied a class of almost contact Riemannian manifolds. Later, such a manifold was called a Kenmotsu manifold. This paper, we studied Kenmotsu manifolds with (2n+s)(2n+s)-dimensional ss-contact metric manifold and this manifold, we have called generalized Kenmotsu manifolds. Necessary and sufficient c…

2014-06-04abs ↗pdf ↗

Study on a new type of manifolds that generalize almost C-manifolds.

problem Understanding weak nearly C-manifolds and their properties.
method Analyzing conditions for local Riemannian product structures and characterizing specific dimensions.
result Conditions for a weak nearly C-manifold to become locally a Riemannian product and characterization of specific dimensions.

Stabilized convex symplectic manifolds are equivalent to flexible Weinstein manifolds.

problem Understanding the equivalence between stabilized convex symplectic manifolds and flexible Weinstein manifolds.
method Analyzing the homotopy type and symplectic properties of the manifolds.
result Stabilized convex symplectic manifolds are symplectomorphic to flexible Weinstein manifolds.

A selfsimiar manifold is a Riemannian manifold (M,g)\left(M,g\right) endowed with a homothetic vector field ξξ. We characterize global selfsimilar manifolds and describe the structure of local selfsimilar manifolds. We prove that any selfsimilar manifold with a potential homothetic vector field is a conical Riemannian ma…

2019-08-05abs ↗pdf ↗

The study provides a structure theorem for a new class of noncompact 3-manifolds.

problem Understanding a new class of noncompact 3-manifolds.
method Proved a structure theorem for irreducible open graph manifolds.
result A canonical 'reduced' decomposition of irreducible open graph manifolds along embedded, incompressible 2-tori.