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

183367550733 · Jun 202019922001200920172026
48 results for work patterns

This research improves LSTM for monthly electricity demand forecasting using pattern-based methods.

problem Forecasting mid-term monthly electricity demand with high accuracy.
method Developed a hybrid LSTM model using x-patterns and exponential smoothing.
result The hybrid model outperformed standard LSTM and classical models.

PbP strategy improves logistic model prediction with missing values.

problem Predicting with missing inputs in logistic models.
method Pattern-by-Pattern (PbP) strategy for logistic models with missing values.
result PbP accurately approximates Bayes probabilities under GPMM across various missing data scenarios.

The paper extends circle pattern flows to hyperbolic and Euclidean geometry.

problem Extending circle pattern flows to hyperbolic and Euclidean geometry.
method Proving the existence and exponential convergence of combinatorial Calabi flows for ideal circle patterns.
result The solution to combinatorial Calabi flows converges exponentially fast to a flat cone metric.

The paper uses pattern similarity-based methods for mid-term electricity demand forecasting.

problem Forecasting monthly electricity demand with seasonal patterns.
method Pattern similarity-based machine learning models (nearest neighbor, fuzzy neighborhood, kernel regression, GRNN).
result The proposed models outperform classical and state-of-the-art models in accuracy and simplicity.

The success of deep networks has been attributed in part to their expressivity: per parameter, deep networks can approximate a richer class of functions than shallow networks. In ReLU networks, the number of activation patterns is one measure of expressivity; and the maximum number of patterns grows exponentially with …

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

The main objective of this study is to understand how geometric hyper-ideal circle patterns can be constructed from given combinatorial angle data. We design a hybrid method consisting of a topological/deformation approach augmented with a variational principle. In this way, together with the question of characterizati…

2014-06-26abs ↗pdf ↗

RestoreAI predicts landmine risk from patterns, improving clearance efficiency.

problem Predicting landmine risk from spatial patterns to enhance clearance efficiency.
method RestoreAI uses landmine patterns for risk prediction, implementing three deminers: linear, curved, and Bayesian.
result RestoreAI significantly boosts clearance efficiency, achieving a 14.37 percentage point increase in cleared landmines per timestep.

The paper integrates statistical significance and discriminative power in pattern discovery.

problem Discovering actionable patterns that meet rigorous statistical significance and discriminative power criteria.
method Integrates statistical significance and discriminative power criteria into state-of-the-art algorithms.
result Improves discriminative power and statistical significance of discovered patterns without quality deterioration.

Previous work on recommender systems mainly focus on fitting the ratings provided by users. However, the response patterns, i.e., some items are rated while others not, are generally ignored. We argue that failing to observe such response patterns can lead to biased parameter estimation and sub-optimal model performanc…

2012-10-16abs ↗pdf ↗

This work improves KG embeddings by integrating hyperbolic and attention mechanisms.

problem Preserving hierarchical and logical patterns in KGs with low-dimensional embeddings.
method Combines hyperbolic reflections/rotations with attention mechanisms to capture complex relational patterns.
result Improves MRR by up to 6.1% on standard benchmarks and new state-of-the-art results in high dimensions.

Deep Convolutional Networks (DCNs) have been shown to be sensitive to Universal Adversarial Perturbations (UAPs): input-agnostic perturbations that fool a model on large portions of a dataset. These UAPs exhibit interesting visual patterns, but this phenomena is, as yet, poorly understood. Our work shows that visually …

2019-06-08abs ↗pdf ↗

A novel framework interprets driving patterns using Action phases clustering.

problem Challenges in comprehending driving heterogeneity from underlying behavior mechanisms.
method Resampling and Downsampling Method (RDM) followed by iterative clustering calibration.
result Six driving patterns identified in real-world datasets, revealing dynamic nature of driving.

Deep neural networks show some layers better align with data than others.

problem Understanding why some layers in deep neural networks better align with data.
method Introducing the Equilibrium Hypothesis to connect alignment pattern to signal propagation.
result The Equilibrium Hypothesis explains the ascent-descent pattern of alignment in deep neural networks.

Study forecasts monthly electricity demand using pattern similarity-based methods.

problem Forecasting monthly electricity demand accurately.
method Pattern similarity-based forecasting methods (PSFMs) including k-NN, fuzzy, kernel regression, and GRNN.
result Ensemble models outperform individual PSFMs in forecasting accuracy.

An image pattern can be represented by a probability distribution whose density is concentrated on different low-dimensional subspaces in the high-dimensional image space. Such probability densities have an astronomical number of local modes corresponding to typical pattern appearances. Related groups of modes can join…

2018-03-02abs ↗pdf ↗

Paper solves long-standing problem of infinite ideal polyhedra in hyperbolic space.

problem Characterize infinite ideal polyhedra in hyperbolic 3-space.
method Introduced combinatorial Ricci flow for infinite ideal circle patterns.
result Proved characterization of infinite ideal circle patterns under specific conditions.

Often the challenge associated with tasks like fraud and spam detection[1] is the lack of all likely patterns needed to train suitable supervised learning models. In order to overcome this limitation, such tasks are attempted as outlier or anomaly detection tasks. We also hypothesize that out- liers have behavioral pat…

2017-12-12abs ↗pdf ↗

Extends circle pattern theorem to quasi-simplicial triangulations.

problem Characterize circle patterns on quasi-simplicial triangulated surfaces.
method Use finite covering technique to reduce problem to simplicial case, prove characterization by KAT inequalities.
result Curvature image is characterized by KAT inequalities.

New guarantees for matrix completion from any deterministic sampling patterns.

problem Proving guarantees for low-rank matrix completion from non-random sampling schemes.
method Introduced a graph with observed entries as edges to analyze the performance of constrained nuclear norm minimization algorithm.
result The algorithm can successfully complete the matrix if the observation graph is well-connected and has similar node degrees.

This report works out the details of a closed-form, fully Bayesian, multiclass, openset, generative pattern classifier using multivariate Gaussian likelihoods, with conjugate priors. The generative model has a common within-class covariance, which is proportional to the between-class covariance in the conjugate prior. …

2013-07-23abs ↗pdf ↗

Quantum-enhanced barcode decoding and pattern recognition outperforms classical methods.

problem Improving barcode decoding and pattern recognition using quantum entanglement.
method Quantum hypothesis testing applied to barcode decoding and pattern recognition using entangled quantum sources and measurements.
result Quantum-enhanced methods outperform classical coherent-state strategies for barcode data decoding and classification.

Pattern recognition and machine learning are becoming integral parts of algorithms in a wide range of applications. Different algorithms and approaches for machine learning include different tradeoffs between performance and computation, so during algorithm development it is often necessary to explore a variety of diff…

2014-06-21abs ↗pdf ↗

ALT improves TSC by capturing complex patterns in time series data.

problem Challenges in traditional TSC methods with time series complexity and variability.
method ALT incorporates variable-length shifted time windows to enhance LLT for better feature representation.
result ALT achieves state-of-the-art performance with few hyperparameters.

A central challenge faced by memory systems is the robust retrieval of a stored pattern in the presence of interference due to other stored patterns and noise. A theoretically well-founded solution to robust retrieval is given by attractor dynamics, which iteratively clean up patterns during recall. However, incorporat…

2018-11-23abs ↗pdf ↗

We present here a general framework and a specific algorithm for predicting the destination, route, or more generally a pattern, of an ongoing journey, building on the recent work of [Y. Lassoued, J. Monteil, Y. Gu, G. Russo, R. Shorten, and M. Mevissen, "Hidden Markov model for route and destination prediction," in IE…

2018-08-31abs ↗pdf ↗

This work proposes hyperbolic deep convolutional neural networks for better pattern recognition.

problem The limitations of Euclidean deep convolutional neural networks in capturing intricate patterns.
method Developed Hyperbolic DCNN based on Poincaré Disc, analyzing expansive convolution in non-Euclidean space.
result Hyperbolic convolutional architecture outperforms Euclidean ones in pattern recognition tasks.

This work views neural networks as data generating systems and applies anomalous pattern detection techniques on that data in order to detect when a network is processing an anomalous input. Detecting anomalies is a critical component for multiple machine learning problems including detecting adversarial noise. More br…

2018-10-19abs ↗pdf ↗

Probabilistic graphical models (PGMs) have become a popular tool for computational analysis of biological data in a variety of domains. But, what exactly are they and how do they work? How can we use PGMs to discover patterns that are biologically relevant? And to what extent can PGMs help us formulate new hypotheses t…

2007-06-14abs ↗pdf ↗

HYPA-DBGNN detects anomalous sequential patterns in temporal graphs.

problem Modeling temporal patterns in dynamic graphs, especially considering deviations from random shuffling.
method Two-step approach combining null model inference and neural message passing.
result HYPA-DBGNN outperforms baseline methods in static node classification tasks.

This study explains RL training dynamics in LLMs, focusing on token-level optimization and reasoning pattern reshaping.

problem Understanding the training dynamics of RL in LLMs to improve their reasoning capabilities.
method Empirical analysis and theoretical modeling of RL training process, focusing on reasoning patterns and token optimization.
result RL primarily optimizes a sparse subset of critical tokens, reshaping reasoning pattern distributions and affecting model performance.

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.