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

54109163217 · Jun 202019922001200920172026
48 results for reduction pattern

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.

Consensus dimension reduction combines multiple visualizations to identify shared patterns.

problem Conflicting visualizations from different dimension reduction methods.
method Multi-view learning to identify stable patterns across multiple views.
result Consensus visualization effectively identifies shared low-dimensional data structure.

KineticSim: A lightweight, high-performance execution engine for real-time market simulators

problem Simulating financial markets at scale with multi-agent models
method Reusable parallel design pattern: persistent, state-carrying clearing for iterative multi-agent reductions
result Reduces per-step critical-path depth from Theta(L+A) to Theta(log L + ceil(A/L))

This work explains RL policies using causal models, revealing important patterns and failures.

problem Understanding why RL policies succeed or fail in complex, high-dimensional systems.
method Developed a nonlinear Causal Model Reduction framework to learn simplified causal models from RL policy actions and rewards.
result The approach can uncover important behavioral patterns and failure modes in trained RL policies.

CAG method predicts nonlinear solid mechanics responses in real-time with high accuracy and efficiency.

problem Real-time prediction of nonlinear solid mechanics responses.
method Clustering adaptive Gaussian process regression (CAG) method.
result Offers predictions within a second with high precision using only 20 samples.

Research from a variety of fields including psychology and linguistics have found correlations and patterns in personal attributes and behavior, but efforts to understand the broader heterogeneity in human behavior have not yet integrated these approaches and perspectives with a cohesive methodology. Here we extract pa…

2017-08-09abs ↗pdf ↗

Research optimizes C++ patterns for HFT, reducing latency and improving profitability.

problem Optimizing latency-critical code for high-frequency trading systems.
method Creation of a Low-Latency Programming Repository, optimisation of trading strategy, implementation of Disruptor pattern.
result Significant performance improvements in speed and profitability.

Random forests reduce bias and variance, especially in low SNR settings.

problem Reducing bias and variance in machine learning models, particularly in low SNR scenarios.
method Empirical study of random forests and bagging ensembles, focusing on the importance of mtrymtry tuning.
result Random forests reduce both bias and variance, outperforming bagging ensembles in high SNR settings.

In this work we propose a method for reducing the dimensionality of tensor objects in a binary classification framework. The proposed Common Mode Patterns method takes into consideration the labels' information, and ensures that tensor objects that belong to different classes do not share common features after the redu…

2019-02-06abs ↗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 ↗

Bayesian calibration improves ABMs for predicting travel patterns.

problem Calibrating ABMs for accurate travel pattern predictions.
method Gaussian Process emulator with deep learning dimensionality reduction for high-dimensional, non-stationary data.
result Improved accuracy in predicting travel patterns using traffic flow data.

The commercialization of deep learning creates a compelling need for intellectual property (IP) protection. Deep neural network (DNN) watermarking has been proposed as a promising tool to help model owners prove ownership and fight piracy. A popular approach of watermarking is to train a DNN to recognize images with ce…

2019-06-11abs ↗pdf ↗

Consumer Demand Response (DR) is an important research and industry problem, which seeks to categorize, predict and modify consumer's energy consumption. Unfortunately, traditional clustering methods have resulted in many hundreds of clusters, with a given consumer often associated with several clusters, making it diff…

2017-02-05abs ↗pdf ↗

Discovering statistical structure from links is a fundamental problem in the analysis of social networks. Choosing a misspecified model, or equivalently, an incorrect inference algorithm will result in an invalid analysis or even falsely uncover patterns that are in fact artifacts of the model. This work focuses on uni…

2017-11-03abs ↗pdf ↗

KineticSim accelerates financial market simulations 3406x over CPU.

problem Simulating financial markets at scale with multi-agent models is bottlenecked by sequential processing and GPU kernel overhead.
method Formalized and implemented a reusable parallel design pattern for iterative multi-agent reductions in thread-block shared memory.
result Achieved a peak throughput of over 54.7 billion agent-events per second, delivering 3406x speedup over CPU.

Study uses NMF to reduce cancer microarray data dimensions.

problem High dimensionality of cancer microarray data hinders understanding.
method Used Non-negative Matrix Factorization (NMF) for dimensionality reduction.
result NMF achieves 98% classification accuracy.

A new geometry-preserving method for interpreting compositional data.

problem Statistical challenges in high-dimensional compositional data.
method Geometry-preserving framework for dimension reduction of compositional data.
result Identification of a central compositional subspace for compositional predictors.

Deep learning is a form of machine learning for nonlinear high dimensional pattern matching and prediction. By taking a Bayesian probabilistic perspective, we provide a number of insights into more efficient algorithms for optimisation and hyper-parameter tuning. Traditional high-dimensional data reduction techniques, …

2017-06-01abs ↗pdf ↗

We consider dimensional reduction of gauge theories with arbitrary gauge group in a formalism based on equivariant principal bundles. For the classical gauge groups we clarify the relations between equivariant principal bundles and quiver bundles, and show that the reduced quiver gauge theories are all generically buil…

2014-04-16abs ↗pdf ↗

MSFA clusters high-dimensional spatial data using spline-based covariance structures.

problem Clustering high-dimensional spatial data with flexible covariance structures.
method Mixture of spatial factor analyzers with spline-based covariance and matrix variate factor analyzers for dimensionality reduction.
result Proposed models accurately infer and differentiate distinct spatial patterns in tensor-variate data.

Reduces data leakage in distributed deep learning models.

problem Prevents reconstruction of sensitive raw data patterns during client communications.
method Reduces distance correlation between raw data and learned representations.
result Resilient to reconstruction attacks while maintaining model accuracy.

New method allows sheets to morph into multiple shapes via spatially varying stimuli.

problem Limitation of current shape-programmed sheets to achieve only one target geometry.
method Patterning the stimulus itself for spatiotemporal control over local deformation magnitudes.
result A single physical sample can be induced to traverse a continuous family of target geometries.

While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly due to the necessary spectral decomposition step, which limits control over the…

2015-08-13abs ↗pdf ↗

We propose 1\ell_1 norm regularized quadratic surface support vector machine models for binary classification in supervised learning. We establish their desired theoretical properties, including the existence and uniqueness of the optimal solution, reduction to the standard SVMs over (almost) linearly separable data s…

2019-08-22abs ↗pdf ↗

SDR outperforms IDR in multimodal data analysis, especially with fewer samples.

problem Understanding and optimizing data efficiency in multimodal representation learning.
method Generative linear model to synthesize multimodal data, comparing IDR and SDR methods.
result Linear SDR methods yield higher-quality, more succinct reduced-dimensional representations with smaller datasets.

Starfield optimizes satellite links for LEO mega-constellations by aligning ISLs with regional traffic patterns.

problem Forming a stable satellite topology in LEO mega-constellations with limited ISLs and unstable acquisition.
method Starfield uses a demand-aware heuristic algorithm based on traffic flows and Riemannian geometry to assign satellite links.
result Starfield reduces hop count and improves stretch factor by up to 30% compared to existing methods.