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

Trend · papers per month

83167250333 · May 202619922001200920172026
48 results for project control

Paper studies binary random projections with controllable sparsity patterns for computational and accuracy advantages.

problem Improving computational efficiency and accuracy in random projections.
method Proposes two sparse binary projection models with controllable sparsity patterns.
result Significant computational advantages and improved accuracies in empirical evaluations.

Paper introduces a new project control method using Monte Carlo and statistical learning.

problem Project control under uncertainty.
method Integrates Earned Value Methodology with Monte Carlo simulation and statistical learning.
result Estimates probabilities of project success and duration.

We present an algorithm for converting an indoor spherical panorama into a photograph with a simulated overhead view. The resulting image will have an extremely wide field of view covering up to 4π steradians of the spherical panorama. We argue that our method complements the stereographic projection commonly used in t…

2012-06-10abs ↗pdf ↗

We extend T. Y. Thomas's approach to the projective structures, over the complex analytic category, by involving the ρρ-connections. This way, a better control of the projective flatness is obtained and, consequently, we have, for example, the following application: if the twistor space of a quaternionic manifold PP

2016-03-05abs ↗pdf ↗

Deployment of emerging technologies and rapid change in industries has created a lot of risk for initiating the new projects. Many techniques and suggestions have been introduced but still lack the gap from various prospective. This paper proposes a reliable project scheduling approach. The objectives of project schedu…

2012-10-07abs ↗pdf ↗

Optimal inequalities found between Riemannian and Hilbert metrics in convex projective domains.

problem Finding optimal bounds between Riemannian and Hilbert metrics in convex projective domains.
method Optimal control techniques applied to Riemannian metrics induced by centro-affine hypersurface immersions.
result Optimal inequalities between Riemannian and Hilbert metrics for a class of convex projective domains.

End-to-end deep reinforcement learning has enabled agents to learn with little preprocessing by humans. However, it is still difficult to learn stably and efficiently because the learning method usually uses a nonlinear function approximation. Neural Episodic Control (NEC), which has been proposed in order to improve s…

2019-04-03abs ↗pdf ↗

Classifies degenerations of complex projective plane with rational singularities.

problem Classifying singularities of complex projective plane.
method Assuming Wahl's conjecture, classifies degenerations using rational homology disk smoothing.
result Classifies surfaces with rational singularities, including new degenerations with non-log canonical singularities.

Bayesian approach to portfolio selection reduces pessimism in frequent trading.

problem Tackling the challenge of estimating drift in Merton's portfolio selection model.
method Bayesian distributionally robust control with nonlinear Wasserstein projections.
result Reduced pessimism and improved performance in frequent rebalancing compared to existing methods.

This paper proposes a model-free and data-adaptive feature screening method for ultra-high dimensional datasets. The proposed method is based on the projection correlation which measures the dependence between two random vectors. This projection correlation based method does not require specifying a regression model an…

2019-08-19abs ↗pdf ↗

Framework for continuous-time network data representation learning.

problem Learning reliable representations of dynamic network interactions.
method Three-stage process: intensity estimation, projection learning, evolving node representation construction.
result Trajectories satisfy structural and temporal coherence, providing robust inference.

BBVI with STL converges geometrically under perfect specification, with quadratic variance bound.

problem Convergence rate of BBVI with STL estimator.
method Proved geometric convergence rate with quadratic variance bound for BBVI with STL estimator.
result BBVI with STL converges geometrically under perfect variational family specification.

Study optimizes portfolio to minimize relative drawdown duration, penalizing unfavorable performance states.

problem Minimizing relative drawdown duration in portfolio optimization relative to a benchmark.
method Introduces a benchmark-relative drawdown-duration criterion penalizing unfavorable performance states. Uses a one-dimensional Markovian representation and Hamilton-Jacobi-Bellman equation.
result Derives explicit projection-based characterization of the optimal feedback control and identifies geometric settings for unique strong solutions.

Performing signal processing tasks on compressive measurements of data has received great attention in recent years. In this paper, we extend previous work on compressive dictionary learning by showing that more general random projections may be used, including sparse ones. More precisely, we examine compressive K-mean…

2015-04-05abs ↗pdf ↗

We prove that non-compact finite volume hyperbolic 3-manifolds that satisfy a mild cohomological condition (infinitesimal rigidity) admit a family of properly convex deformations of their complete hyperbolic structure where the ends become generalized cusps of type 1 or type 2. We also discuss methods for controlling w…

2018-05-23abs ↗pdf ↗

Algorithm optimizes system design and control for better rewards.

problem Optimizing system design and control for maximum rewards.
method Deep reinforcement learning combining policy gradient and model-based optimization.
result DEPS algorithm outperforms state-of-the-art methods in various environments.

New method reduces memory usage for high-dimensional variable selection.

problem Scalability issues in high-dimensional variable selection, especially in genomics.
method Adaptive sampling of null features to eliminate dummy matrix materialization.
result Reduces memory and runtime by several orders of magnitude while preserving FDR control.

Regulated curves on Banach manifolds with continuous projections and regulated derivatives are studied.

problem Regulated curves on Banach manifolds with continuous projections and regulated derivatives.
method Building a Banach manifold structure on the set of such curves.
result Existence of a 'local addition' on such a manifold for any Banach manifold.

Gaussian processes (GPs) provide flexible distributions over functions, with inductive biases controlled by a kernel. However, in many applications Gaussian processes can struggle with even moderate input dimensionality. Learning a low dimensional projection can help alleviate this curse of dimensionality, but introduc…

2019-12-30abs ↗pdf ↗

Given a geometrically finite hyperbolic cone-manifold, with the cone singularity sufficiently short, we construct a one parameter family of cone-manifolds decreasing the cone angle to zero. We also control the geometry of this one parameter family via the Schwarzian derivative of the projective boundary and the length …

2002-11-26abs ↗pdf ↗

Sharp-SSL uses random projections to identify important variables for semi-supervised learning.

problem High-dimensional semi-supervised learning problems.
method Careful aggregation of low-dimensional results from many axis-aligned random projections.
result Sharp-SSL algorithm can recover signal coordinates with high probability.

A new method removes biases in data integration by using surrogate control outcomes.

problem Data integration methods can be biased due to data-dependent processes.
method Post-integrated inference method using surrogate control outcomes to account for latent heterogeneity.
result The method provides consistent and efficient estimators under minimal assumptions and potential misspecifications.

The study connects projective codes to the distribution of zeros of odd maps.

problem Understanding the distribution of zeros of odd maps from spheres to Euclidean space.
method Using the topology of the space of probability measures on the sphere.
result Generalization of the Borsuk-Ulam theorem and its four consequences.

The support vector machine (SVM) is an important class of learning machines for function approach, pattern recognition, and time-serious prediction, etc. It maps samples into the feature space by so-called support vectors of selected samples, and then feature vectors are separated by maximum margin hyperplane. The pres…

2016-02-12abs ↗pdf ↗

Enhances projection pursuit tree classifier with visual diagnostics for better multi-class classification.

problem Rigidity of original algorithm limits performance in complex high-dimensional classification problems.
method Allowing more splits and flexible class groupings in projection pursuit computation, and developing visual diagnostics.
result Demonstrates enhanced classifier performs as intended through interactive visual diagnostics.

Study Hilbert's projective metric for bounded growth functions leading to Sinkhorn's algorithm convergence.

problem Optimal transport in unbounded settings with heavy-tailed distributions.
method Hilbert's projective metric for integrable functions of bounded growth, kernel integral operators as contractions.
result Exponential convergence of Sinkhorn's algorithm for light-tailed marginal distributions.

After presenting Actor Critic Methods (ACM), we show ACM are control variate estimators. Using the projection theorem, we prove that the Q and Advantage Actor Critic (A2C) methods are optimal in the sense of the L2L^2 norm for the control variate estimators spanned by functions conditioned by the current state and acti…

2019-07-23abs ↗pdf ↗

We introduce a family of copulas which are locally piecewise uniform in the interior of the unit cube of any given dimension. Within that family, the simultaneous control of tail dependencies of all projections to faces of the cube is possible and we give an efficient sampling algorithm. The combination of these two pr…

2009-06-26abs ↗pdf ↗

New PG methods tackle nonconvex optimization with auto-conditioned stepsizes.

problem Optimizing nonconvex functions over convex sets.
method Auto-conditioned projected gradient (AC-PG) methods and stochastic variants.
result Achieved optimal iteration complexity for finding approximate stationary points.