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

4896143191 · Jun 202019922001200920172026
48 results for Projection Pattern

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.

Detects project management anti-patterns using code and issue data.

problem Detecting project management anti-patterns requires expert judgment and is expensive.
method Convert descriptions to detectable metrics, quantify deviations, and optimize patterns.
result Automatic calibration enhances pattern detection and severity assessment.

Study circle patterns on tori, linking symplectic forms and homeomorphisms.

problem Understanding circle patterns on tori and their symplectic properties.
method Investigates the space of circle patterns on closed tori with complex projective structures, embedding it into Teichmüller spaces and analyzing symplectic forms.
result Non-degeneracy of the pulled-back Weil-Petersson symplectic form and homeomorphism between circle patterns and Teichmüller spaces.

Study circle patterns and polyhedral surfaces in hyperbolic ends, proving manifold properties.

problem Understanding the space of complex projective structures on surfaces with circle patterns.
method Analyzing ideal polyhedral surfaces in hyperbolic ends, proving manifold properties and Lagrangian immersions.
result The space of complex projective structures on surfaces with circle patterns is a manifold of dimension 6g-6.

We present algorithms for topic modeling based on the geometry of cross-document word-frequency patterns. This perspective gains significance under the so called separability condition. This is a condition on existence of novel-words that are unique to each topic. We present a suite of highly efficient algorithms based…

2013-03-15abs ↗pdf ↗

We introduce switched linear projections for expressing the activity of a neuron in a deep neural network in terms of a single linear projection in the input space. The method works by isolating the active subnetwork, a series of linear transformations, that determine the entire computation of the network for a given i…

2019-09-25abs ↗pdf ↗

Given a triangulation of a closed surface, we consider a cross ratio system that assigns a complex number to every edge satisfying certain polynomial equations per vertex. Every cross ratio system induces a complex projective structure together with a circle pattern on the closed surface. In particular, there is an ass…

2019-09-16abs ↗pdf ↗

FEALM learns features for better nonlinear DR of hidden patterns.

problem DR misses important patterns on distorted manifolds.
method FEALM generates optimized projections using an optimization algorithm and neighbor-shape dissimilarity.
result FEALM captures important patterns on hidden manifolds.

The paper develops finite knot theory using ropelength-filtered Reidemeister graphs.

problem Understanding knot types in bounded ropelength sublevel spaces.
method Study thick representatives in bounded ropelength sublevel spaces through lifted Reidemeister graphs.
result Define characteristic Reidemeister patterns and finite recognition length.

LLE produces unwanted results without regularization, which can be prevented with regularization.

problem LLE's inherent unwanted results without regularization.
method Mathematical proof and numerical examples of regularization effectiveness.
result Regularization prevents unwanted results in LLE.

LeanML reduces machine learning project waste by estimating best performance without training models.

problem Avoidable wastes in machine learning projects.
method Lean design pattern based on mutual information and performance metrics.
result Estimating best performance without training models is faster and cheaper.

It has been reported repeatedly that discriminative learning of distance metric boosts the pattern recognition performance. A weak point of ITML-based methods is that the distance threshold for similarity/dissimilarity constraints must be determined manually and it is sensitive to generalization performance, although t…

2018-01-07abs ↗pdf ↗

A Delaunay cell decomposition of a surface with constant curvature gives rise to a circle pattern, consisting of the circles which are circumscribed to the facets. We treat the problem whether there exists a Delaunay cell decomposition for a given (topological) cell decomposition and given intersection angles of the ci…

2003-12-18abs ↗pdf ↗

The fastICA method is a popular dimension reduction technique used to reveal patterns in data. Here we show both theoretically and in practice that the approximations used in fastICA can result in patterns not being successfully recognised. We demonstrate this problem using a two-dimensional example where a clear struc…

2018-05-25abs ↗pdf ↗

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 ↗

SQS uses quantum kernels to improve credit scoring with fewer data points.

problem Credit scoring models struggle with scarce and skewed data.
method Systemic Quantum Score (SQS) leverages quantum kernels for better pattern extraction.
result SQS shows improved performance and pattern extraction with fewer data points.

New method reduces computational cost for nonnegative low rank matrix approximation.

problem Efficiently compute nonnegative low rank matrix approximation for nonnegative matrices.
method Alternating projections onto tangent spaces of fixed rank matrices manifold and nonnegative matrix manifold.
result Sequence converges linearly to optimal solutions, showing better performance in terms of computational time and accuracy.

Using publicly available traffic camera data in New York City, we quantify time-dependent patterns in aggregate pedestrian foot traffic. These patterns exhibit repeatable diurnal behaviors that differ for weekdays and weekends but are broadly consistent across neighborhoods in the borough of Manhattan. Weekday patterns…

2019-10-06abs ↗pdf ↗

Moirai-MoE improves time series forecasting by automatically specializing tokens without human-defined frequency.

problem Unified training on time series data remains challenging due to heterogeneity and non-stationarity.
method Uses sparse mixture of experts (MoE) within Transformers to automatically specialize tokens for diverse time series patterns.
result Moirai-MoE outperforms existing foundation models in both in-distribution and zero-shot scenarios.

In this paper, we propose a new algorithm for exploratory projection pursuit. The basis of the algorithm is the insight that previous approaches used fairly narrow definitions of interestingness / non interestingness. We argue that allowing these definitions to depend on the problem / data at hand is a more natural app…

2011-12-19abs ↗pdf ↗

Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.

problem Complex multi-group classification problems with nonlinear decision boundaries and group-specific covariance patterns.
method MGQDA, a method based on quadratic discriminant analysis that projects predictors onto a lower-dimensional subspace.
result MGQDA achieves competitive or improved predictive performance compared to existing methods.

Study evaluates risk in options using volatility surface projections.

problem Risk assessment of options due to their non-linear price behavior and volatility fluctuations.
method Parametric surface projection method for implied volatility.
result Enhanced risk evaluation through dynamic volatility surface analysis.

A new algorithm estimates sparse gradients on graphs with improved risk bounds.

problem Estimating sparse gradients on graph-structured data.
method Tree-Projected Gradient Descent algorithm for gradient-sparse parameters.
result Achieves risk bound of snlog(1+ps)\frac{s^*}{n} \log (1+\frac{p}{s^*}).

Rocket algorithm classifies time-series data efficiently using random projections and natural sparsity.

problem Time-series classification challenges in diverse fields.
method Random convolutional kernels, non-linear transformation, compressed sensing framework.
result Rocket algorithm preserves discriminative patterns in time-series data and expresses inherent sparsity.

The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assum…

2012-05-09abs ↗pdf ↗

Optimal trading patterns adjust based on market efficiency and slippage costs.

problem Balancing active alphas and trading costs in active portfolios.
method Maximization of utility including projected alpha-based profits, slippage costs, and risk aversion.
result Optimal trading involves a no-trade zone width that scales as Δc1/2Δ\sim c^{1/2}, differing from stochastic settings.

The study examines how bias affects hypothesis formation in neural networks.

problem Characterizing the impact of bias on hypothesis formation in neural networks.
method An automated data-driven projection pursuit neural network to extract and select features for binary classification.
result The refinement of a working hypothesis converges to a robust multivariate perception of data.

Unified framework recovers exact input from SOM activation patterns.

problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.

Geopolitical and geoeconomic shocks affect sovereign risk differently, with distinct transmission channels.

problem Understanding how geopolitical and geoeconomic shocks impact sovereign credit risk.
method Daily panel data of 42 economies over 2018-2025; semistructural framework; Shapley-Taylor decomposition; machine learning predictions; placebo and sign-restricted SVAR evidence.
result Geopolitical shocks primarily increase sovereign credit spreads through direct repricing, while geoeconomic shocks mainly affect spreads through financial conditions and policy uncertainty.