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

Trend · papers per month

51102153204 · Jun 202019922001200920172026
48 results for flexible patterns

Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations wh…

2016-10-28abs ↗pdf ↗

This paper proves a deformation circle pattern theorem, which gives a complete description of those circle patterns with interstices in terms of the combinatorial type, the exterior intersections angles and the conformal structures of interstices. As results, the surface version of Rivin's theorem and the approximation…

2018-05-22abs ↗pdf ↗

Flexible Cox model for time-dependent covariates with complex sparsity patterns.

problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.

We aim to model unknown file processing. As the content of log files often evolves over time, we established a dynamic statistical model which learns and adapts processing and parsing rules. First, we limit the amount of unstructured text by focusing only on those frequent patterns which lead to the desired output tabl…

2020-01-05abs ↗pdf ↗

New framework for dense weighted networks with community-specific patterns.

problem Dense networks with varying edge weights across communities.
method Proposes a new model with functions mapping node characteristics to edge weights, requiring few parameters.
result Developed a bootstrap methodology for generating new networks.

We consider the problem of impulse response estimation of stable linear single-input single-output systems. It is a well-studied problem where flexible non-parametric models recently offered a leap in performance compared to the classical finite-dimensional model structures. Inspired by this development and the success…

2018-01-25abs ↗pdf ↗

It is not until recently that graph neural networks (GNNs) are adopted to perform graph representation learning, among which, those based on the aggregation of features within the neighborhood of a node achieved great success. However, despite such achievements, GNNs illustrate defects in identifying some common struct…

2019-11-18abs ↗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.

Deep learning for missing data with flexible modelling.

problem Missing data with missingness dependent on the missing values.
method Deep latent variable models with a neural network for missingness pattern modeling, importance-weighted variational inference, and stochastic gradients.
result Explicitly modelling missingness improves inference on various data sets.

Dockless bike sharing systems need effective bike flow prediction models.

problem Imbalanced and dynamic use of bikes leads to mandatory rebalancing operations.
method Divide urban area into regions, model spatio-temporal bike flows, extract traffic patterns, and predict bike flows.
result Interpretable bike flow prediction model provides valuable insights into bike flow analysis.

A new matrix factorization method for high-dimensional data.

problem Exploiting sparse structures in complex data for better interpretability.
method Bayesian shrinkage priors and flexible sparse patterns modeled through row and column dependencies.
result Demonstrated practical advantages through simulation and soccer heatmap analysis.

The majority of real-world networks are dynamic and extremely large (e.g., Internet Traffic, Twitter, Facebook, ...). To understand the structural behavior of nodes in these large dynamic networks, it may be necessary to model the dynamics of behavioral roles representing the main connectivity patterns over time. In th…

2012-05-09abs ↗pdf ↗

Neural network based generative models with discriminative components are a powerful approach for semi-supervised learning. However, these techniques a) cannot account for model uncertainty in the estimation of the model's discriminative component and b) lack flexibility to capture complex stochastic patterns in the la…

2017-06-29abs ↗pdf ↗

Modeling dynamic user interests using neural matrix factorization.

problem Challenging extraction of valuable insights from unstructured, high-dimensional, and dynamic online content data.
method Combines matrix factorization with neural networks to model nonlinear user and content factors.
result Accurately identifies nuanced and coherent consumption patterns of Boston Globe readers over five years.

COP improves online conformal prediction by incorporating data patterns, leading to tighter prediction sets.

problem Overly conservative prediction sets in online conformal prediction methods when data distribution shifts.
method Conformal Optimistic Prediction (COP) incorporating estimated cumulative distribution function of non-conformity scores.
result COP produces tighter prediction sets with valid coverage guarantees, outperforming other methods.

DUET enhances multivariate time series forecasting by clustering time and channels.

problem Heterogeneous temporal patterns and complex channel correlations in multivariate time series.
method DUET uses dual clustering on temporal and channel dimensions to handle these challenges.
result DUET achieves state-of-the-art performance on 25 real-world datasets.

Sparsity-promoting priors have become increasingly popular over recent years due to an increased number of regression and classification applications involving a large number of predictors. In time series applications where observations are collected over time, it is often unrealistic to assume that the underlying spar…

2012-03-01abs ↗pdf ↗

A novel nonstationary permanental process relaxes kernel constraints and captures complex data patterns.

problem Limitations of existing permanental processes in terms of kernel types and stationarity.
method Sparse spectral representation of nonstationary kernels and hierarchical stacking of spectral feature mappings.
result Enhanced model expressiveness and reduced computational complexity.

Gaussian process modulated Poisson processes provide a flexible framework for modelling spatiotemporal point patterns. So far this had been restricted to one dimension, binning to a pre-determined grid, or small data sets of up to a few thousand data points. Here we introduce Cox process inference based on Fourier feat…

2018-04-03abs ↗pdf ↗

Recent advancements in recurrent neural network (RNN) research have demonstrated the superiority of utilizing multiscale structures in learning temporal representations of time series. Currently, most of multiscale RNNs use fixed scales, which do not comply with the nature of dynamical temporal patterns among sequences…

2019-02-15abs ↗pdf ↗

Proposes a method to infer complex network topologies from multiple graphs.

problem Learning multiple graph Laplacian matrices from heterogeneous graph signals with intricate topological patterns.
method Structured fusion regularization and ADMM algorithm for efficient computation.
result Establishes a non-asymptotic bound of the estimation error and reflects the effect of key factors on convergence rate.

Ultra-fast search algorithm for trillion-scale corpora with semantic flexibility.

problem Efficiently searching over large natural language corpora with semantic variations.
method String matching based on suffix arrays, vector representation of words, dynamic corpus-aware pruning, fast exact lookup.
result Substantially lower search latency compared to existing methods on FineWeb-Edu corpus.

New method combines randomization tests and flexible models for valid inference without splitting data.

problem Valid inference in randomized panel experiments with complex effect heterogeneity.
method Model-assisted randomization tests that estimate unsigned CATE from residualized outcomes.
result CATE-assisted tests control Type I error and achieve higher power than alternatives.

Signals coming from multivariate higher order conditional moments as well as the information contained in exogenous covariates, can be effectively exploited by rational investors to allocate their wealth among different risky investment opportunities. This paper proposes a new flexible dynamic copula model being able t…

2016-01-20abs ↗pdf ↗

METRO predicts reactions using minimal templates, reducing computational overhead and achieving state-of-the-art results.

problem Predicting possible reaction substrates for complex molecules from simpler precursors.
method METRO (Molecule-Edit Templates for RetrOsynthesis) uses minimal templates to predict reactions efficiently and accurately.
result METRO achieves state-of-the-art results on standard benchmarks, reducing computational overhead.

Proposes a new model to analyze mortgage delinquency transitions.

problem Analyzing mortgage delinquency transitions in a flexible yet identifiable way.
method Combines structured additive predictor with neural network for complex interactions, orthogonalising components for identifiability.
result The semi-structured model provides modest gains in discrimination compared to a structured model, especially in the early prediction spans.

New topological methods for hypergraph data improve community detection and pattern recognition.

problem Community detection and pattern recognition in hypergraph data.
method Introducing a new topological space structure of hypergraph data, proposing modified nearest neighbors methods.
result Improved methods for community detection and pattern recognition in hypergraph data.

We develop correlated random measures, random measures where the atom weights can exhibit a flexible pattern of dependence, and use them to develop powerful hierarchical Bayesian nonparametric models. Hierarchical Bayesian nonparametric models are usually built from completely random measures, a Poisson-process based c…

2015-07-02abs ↗pdf ↗

Reprogram deep models to resist adversarial attacks without changing parameters.

problem Improving deep learning models' robustness against adversarial and noisy inputs.
method Proposes a non-linear robust pattern matching technique and three reprogramming paradigms.
result Demonstrates effective reprogramming of deep models for robustness without altering parameters.

Novel defects in hyperbolic sheets explain complex wrinkling patterns in nature.

problem Understanding complex wrinkling patterns in thin elastic hyperbolic surfaces.
method Non-Euclidean plate theory and investigation of branch points.
result Branch points are natural defects in hyperbolic sheets, influencing their morphology robustly.

This paper proposes a web-based visual graph analytics platform for interactive graph mining, visualization, and real-time exploration of networks. GraphVis is fast, intuitive, and flexible, combining interactive visualizations with analytic techniques to reveal important patterns and insights for sense making, reasoni…

2015-02-02abs ↗pdf ↗

New method predicts wind farm power and wakes using weather patterns.

problem Inefficient and computationally intensive wind energy resource assessment.
method Unsupervised clustering of ERA5 data on wind velocity, WRF simulations at cluster centers, and post-processing.
result Accurate long-term predictions of power and wakes with reduced computational time.

Proposes a new model for complex multivariate event data.

problem Modeling complex multivariate event data with spatio-temporal dynamics.
method Integrates spatial information into latent state evolution through learned temporal and spatial decay dynamics.
result Successfully recovers sensible temporal and spatial intensity structure in multivariate spatio-temporal point patterns.