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

219438656875 · Jun 202019922001200920172026
48 results for PO algorithms

Proposes PO-QA framework to optimize portfolios using quantum algorithms.

problem Optimizing investment portfolios with reduced risk and increased gains.
method Develops a scalable quantum framework (PO-QA) to investigate quantum algorithm parameters.
result Identifies efficient quantum circuit configurations for portfolio optimization.

Paper eliminates warm-up phase for PO in linear MDPs, achieving optimal regret.

problem Costly warm-up phase in PO algorithms for linear MDPs.
method Simple contraction mechanism replaces warm-up phase.
result Achieves rate-optimal regret with improved dependence on problem parameters.

RANDomized-exploration policy Optimization via Multiple Importance Sampling with Truncation (RANDOMIST) for PO with mediator feedback.

problem Policy Optimization in continuous control tasks.
method RANDomized-exploration policy Optimization via Multiple Importance Sampling with Truncation (RANDOMIST) for regret minimization in PO.
result Achieving constant regret under certain circumstances in PO with mediator feedback.

Stochastic particle-optimization sampling (SPOS) is a recently-developed scalable Bayesian sampling framework that unifies stochastic gradient MCMC (SG-MCMC) and Stein variational gradient descent (SVGD) algorithms based on Wasserstein gradient flows. With a rigorous non-asymptotic convergence theory developed recently…

2018-11-20abs ↗pdf ↗

Paper proposes set-valued prediction for historical POS tagging.

problem Difficult POS tagging in historical corpora due to lack of native speakers and sparse data.
method Set-valued prediction approach to allow uncertainty in tagging.
result Set-valued prediction improves POS tagging precision and robustness.

Part-of-speech (POS) tagging is a fundamental component for performing natural language tasks such as parsing, information extraction, and question answering. When POS taggers are trained in one domain and applied in significantly different domains, their performance can degrade dramatically. We present a methodology f…

2014-10-31abs ↗pdf ↗

West Frisian lemmatizer, POS tagger, and parser created.

problem Creating accurate lemmatization, POS tagging, and dependency parsing for West Frisian.
method Using a corpus of 44,714 words annotated according to Universal Dependency version 2. Applying Dutch POS tags and morphological/syntactic annotations to create Frisian translations.
result Significant improvement in lemma accuracy compared to default parameters.

Positive representations of surface groups in PO(p,q) form connected components of character varieties.

problem Characterizing representations of surface groups in special orthogonal groups PO(p,q).
method Using Anosov representations and root versus weight collar lemmas.
result Connected components of character varieties are formed by ΘΘ-positive Anosov representations.

ICP improves text infilling and POS tagging with valid confidence sets.

problem Statistical reliability of machine learning predictions.
method Inductive conformal prediction algorithms for text infilling and POS tagging.
result Valid set-valued predictions with small size for real-world applications.

PO-Flow models potential and counterfactual outcomes for personalized treatment decisions.

problem Predicting individualized treatment effects from observational data.
method Continuous normalizing flow (CNF) framework for causal inference.
result Unified approach to potential outcome prediction, treatment effect estimation, and counterfactual prediction.

We show that the non-arithmetic lattices in PO(n,1) of Belolipetsky and Thomson (2011), obtained as fundamental groups of closed hyperbolic manifolds with short systole, are quasi-arithmetic in the sense of Vinberg, and, by contrast, the well-known non-arithmetic lattices of Gromov and Piatetski-Shapiro are not quasi-a…

2014-12-16abs ↗pdf ↗

A new algorithm enhances minority class representation in imbalanced datasets.

problem Improving classification performance on imbalanced datasets.
method PO-QG algorithm using Proxima-Orion neighbors and q-Gaussian weighting.
result The PO-QG algorithm improves overall classification performance.

A new framework for performative prediction robust to distributional misspecification.

problem Performative prediction models can be influenced by their own predictions, leading to suboptimal outcomes.
method Introduces distributionally robust performative prediction (DRPO) to approximate the true performative optimum (PO) robustly.
result DRPO provides provable guarantees as a robust approximation to the true PO when the nominal distribution map is misspecified.

Improved method reduces projection calls for nonsmooth convex optimization.

problem Optimizing nonsmooth convex functions with convex constraints.
method MOPES and MOLES methods combining Moreau-Yosida smoothing and accelerated first-order schemes.
result Achieves εε-suboptimality with significantly fewer projection calls.

New Teichmüller spaces found for higher-dimensional groups.

problem Finding new Teichmüller spaces for higher-dimensional groups.
method Proving representations of groups in pseudo-Riemannian hyperbolic spaces are convex cocompact.
result Set of representations forms connected components of Hom spaces.

Limit sets of AdS\mathrm{AdS}-quasi-Fuchsian groups of PO(n,2)\mathrm{PO}(n,2) are always Lipschitz submanifolds. The aim of this article is to show that they are never C1\mathcal{C}^1, except for the case of Fuchsian groups. As a byproduct we show that AdS\mathrm{AdS}-quasi-Fuchsian groups that are not Fuchsian are Zariski d…

2018-09-27abs ↗pdf ↗

Study extends Hausdorff dimension Hessian results to new hyperconvex representations.

problem Extending classical results on Hausdorff dimension Hessian.
method Analyzes (1,1,2)-hyperconvex representations and small complex deformations.
result Positive definiteness of Hessian of Hausdorff dimension for co-compact Γ in PO(n,1).

This paper identifies and bounds ICE central moments using PO marginal central moments.

problem Identifying and characterizing treatment effect heterogeneity.
method Using only marginal central moments of potential outcomes, the paper identifies and bounds central moments of individual causal effects.
result Identification and bounding of central moments of ICE using marginal moments of POs.

Derives a new objective to learn from human preferences without approximations.

problem Learning from human preferences through RLHF relies on approximations that can lead to pitfalls.
method Derives a new general objective ΨΨPO that bypasses both approximations.
result Demonstrates the superiority of the new objective to Direct Preference Optimisation (DPO) empirically.

We study here compact manifolds with positive scalar curvature metrics. We use the relative Yamabe invariant from math.DG/0008138 to define the conformal cobordism relation on the category of such manifolds. We prove that corresponding conformal cobordism groups $\Pos_n^{\conf}(γ)$ are isomorphic to the cobordism group…

2000-08-17abs ↗pdf ↗

We break down transformer embeddings into interpretable components revealing hidden geometric structures.

problem Understanding the hidden geometry and interpretability of transformer models.
method Decomposed transformer embeddings into position, context, and residual components.
result Pervasive mathematical structure in transformer embeddings, including position and context vectors.

Proof of Stake (PoS) is a burgeoning Sybil resistance mechanism that aims to have a digital asset ("token") serve as security collateral in crypto networks. However, PoS has so far eluded a comprehensive threat model that encompasses both Byzantine attacks from distributed systems and financial attacks that arise from …

2019-11-28abs ↗pdf ↗

Centralized exchanges influence staking behavior and decentralization in Proof of Stake blockchain ecosystems.

problem How do centralized exchanges affect staking behavior and decentralization in Proof of Stake blockchain ecosystems?
method Formulate a continuous-time mean field model of miners as validators and traders in a centralized market.
result Centralized trading activities enhance staking participation and promote decentralization through market incentives.

The paper explores methods to better estimate treatment effects by leveraging shared structure in potential outcomes.

problem Estimating treatment effects when outcomes may vary widely and existing methods often assume heterogeneity.
method Investigates and compares three learning strategies: regularization, reparametrization, and a multi-task architecture.
result All three approaches improve upon existing baselines, providing insights into their relative strengths.

Ethereum transition to PoS reduces energy consumption and decentralizes the network.

problem Transitioning from proof-of-work to proof-of-stake to reduce energy consumption and decentralize the network.
method Analyzed the impact of the Ethereum transition to proof-of-stake on network performance, competing platforms, and transaction fees.
result The transition to PoS has reduced energy consumption by 99.98% and decreased network concentration.

Labeling of sequential data is a prevalent meta-problem for a wide range of real world applications. While the first-order Hidden Markov Models (HMM) provides a fundamental approach for unsupervised sequential labeling, the basic model does not show satisfying performance when it is directly applied to real world probl…

2019-04-05abs ↗pdf ↗

Model shows PoS networks can be captured by external finance, leading to centralization.

problem Long-term centralization of PoS networks under external finance pressures.
method Heterogeneous macroeconomic model with two actor classes: investors and consumers.
result External finance forces PoS networks to centralize, leading to zero internal staking yield.

Unique domain found in Einstein universe, simplifying manifold classification.

problem Classifying closed conformally flat manifolds with proper development.
method Identifying and analyzing almost-homogeneous domains in the Einstein universe.
result Found a unique domain (diamond) in the Einstein universe that simplifies manifold classification.

Unified framework for stable RL learning with theoretical guarantees.

problem Lack of systematic theoretical principles guiding RL post-training methods.
method Unified theoretical framework for policy-gradient estimators and optimization algorithms.
result Establishes unbiasedness, variance expressions, and convergence guarantees.

Proposes ICC method for dynamic portfolio optimization.

problem Non-stationarity in market conditions makes traditional portfolio optimization ineffective.
method Inverse Covariance Clustering (ICC) to identify market states and integrate into dynamic optimization.
result ICC-PO generates portfolios with higher Sharpe Ratios and greater robustness.

State-of-the-art sequence labeling systems traditionally require large amounts of task-specific knowledge in the form of hand-crafted features and data pre-processing. In this paper, we introduce a novel neutral network architecture that benefits from both word- and character-level representations automatically, by usi…

2016-03-04abs ↗pdf ↗

We determine the minimal volume of arithmetic hyperbolic orientable n-dimensional orbifolds (compact and non-compact) for every odd dimension n>3. Combined with the previously known results it solves the minimal volume problem for arithmetic hyperbolic n-orbifolds in all dimensions.

2010-01-26abs ↗pdf ↗

We introduce and motivate a notion of pseudo-arithmeticity, which possibly applies to all lattices in PO(n,1)\mathrm{PO}(n,1) with n>3n>3. We further show that under an additional assumption (satisfied in all known cases), the covolumes of these lattices correspond to rational linear combinations of special values of LL-fun…

2018-10-30abs ↗pdf ↗

We show that for any po sitive integer mm, there exist order nn Stein corks. The boundaries are cyclic branched covers of slice knots embedded in the boundary of corks. By applying these corks to generalized forms, we give a method producing examples of many finite order corks, which are possibly not Stein cork.

2016-01-27abs ↗pdf ↗