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

6481,2961,9442,592 · Jun 202019922001200920172026
48 results for Marr's levels of analysis

The Frame Problem (FP) is a puzzle in philosophy of mind and epistemology, articulated by the Stanford Encyclopedia of Philosophy as follows: "How do we account for our apparent ability to make decisions on the basis only of what is relevant to an ongoing situation without having explicitly to consider all that is not …

2017-01-26abs ↗pdf ↗

A new algorithm improves Wasserstein discriminant analysis for better data classification.

problem Improving data classification in machine learning.
method Bi-level nonlinear eigenvector algorithm (WDA-nepv) for optimal transport and trace ratio optimizations.
result WDA-nepv enhances classification accuracy and scalability.

The level crossing and inverse statistics analysis of DAX and oil price time series are given. We determine the average frequency of positive-slope crossings, να+ν_α^+, where Tα=1/να+T_α =1/ν_α^+ is the average waiting time for observing the level αα again. We estimate the probability P(K,α)P(K, α), which provides us the probab…

2010-01-25abs ↗pdf ↗

A Python tool generates synthetic data for cluster analysis from high-level descriptions.

problem Creating synthetic data for cluster analysis is laborious and requires detailed geometric parameters.
method Proposes natural language-based synthetic data generation and implements it in a Python package.
result Makes it easy to set up interpretable and reproducible benchmarks for cluster analysis.

As mobile devices become more and more popular, mobile gaming has emerged as a promising market with billion-dollar revenues. A variety of mobile game platforms and services have been developed around the world. A critical challenge for these platforms and services is to understand the churn behavior in mobile games, w…

2019-01-14abs ↗pdf ↗

This paper introduces compositional data analysis for financial ratios, improving industry-level analysis.

problem Statistical issues with standard financial ratios at industry level.
method Compositional data analysis techniques for financial ratios.
result Improved analysis of financial ratios using compositional data methods.

DeepSupp detects financial support levels using attention mechanisms.

problem Traditional SR identification methods fail to adapt to modern markets.
method Multi-head attention mechanisms, dynamic correlation matrices, DBSCAN clustering.
result DeepSupp outperforms six baseline methods across six financial metrics.

Factor analysis provides linear factors that describe relationships between individual variables of a data set. We extend this classical formulation into linear factors that describe relationships between groups of variables, where each group represents either a set of related variables or a data set. The model also na…

2014-11-21abs ↗pdf ↗

Symbolic data analysis (SDA) is an emerging area of statistics concerned with understanding and modelling data that takes distributional form (i.e. symbols), such as random lists, intervals and histograms. It was developed under the premise that the statistical unit of interest is the symbol, and that inference is requ…

2018-09-11abs ↗pdf ↗

Novel approach models life events using causal discovery and survival analysis.

problem Modeling life event choices and occurrence from a probabilistic perspective.
method Bi-level problem formulation: causal discovery for life events graph, survival analysis for time-to-event modeling.
result Identification of causal relationships and factors influencing transition rates between life events.

Study finds environmental liability insurance reduces industrial carbon emissions.

problem Reduction of industrial carbon emissions.
method Two-way fixed effect model using provincial (city) level panel data from 2010 to 2020.
result Environmental liability insurance reduces industrial carbon emissions at both direct and indirect levels, with varying effects.

Local Neural Operators enable efficient system-level analysis of complex PDEs.

problem System-level analysis of large-scale dynamical systems using neural operators.
method Integrating local Neural Operators with Krylov subspace iterative methods for stability and bifurcation analysis.
result Demonstrated effectiveness of local Neural Operators in fixed-point, stability, and bifurcation analysis of nonlinear PDEs.

BSD is a Bayesian framework for analyzing neural spectral data.

problem Challenges in statistical analysis and group-level comparisons of neural power spectra.
method Bayesian Spectral Decomposition (BSD) for parametric models of neural spectra.
result BSD outperforms existing methods in model selection and parameter estimation.

Introduces Motion Programs for better video analysis of human motion.

problem Current video analysis focuses on raw pixels or keypoints, missing higher-level motion primitives.
method Introduces Motion Programs as a neuro-symbolic representation of motions as a composition of high-level primitives.
result Motion Programs accurately describe diverse human motions and improve downstream tasks.

The so-called level crossing analysis has been used to investigate the empirical data set. But there is a lack of interpretation for what is reflected by the level crossing results. The fractional Gaussian noise as a well-defined stochastic series could be a suitable benchmark to make the level crossing findings more s…

2011-12-07abs ↗pdf ↗

The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset. By representing the hierarchy of data modes as a dendrogram of the level sets of a density estimator, this approach offers many advantages for exploratory analysis…

2013-07-30abs ↗pdf ↗

Bayesian CNN improves MRI stroke diagnosis accuracy and uncertainty quantification.

problem Uncertainty quantification in automated image analysis for medical decision-making.
method Bayesian Convolutional Neural Network (CNN) with aggregation methods for patient-level diagnoses.
result Bayesian CNN achieved 95.33% accuracy on 511 patients, 2% higher than non-Bayesian.

Quantitative Investment, built on the solid foundation of robust financial theories, is at the center stage in investment industry today. The essence of quantitative investment is the multi-factor model, which explains the relationship between the risk and return of equities. However, the multi-factor model generates e…

2019-10-12abs ↗pdf ↗

We applied Generative Adversarial Networks (GANs) to learn a model of DOOM levels from human-designed content. Initially, we analysed the levels and extracted several topological features. Then, for each level, we extracted a set of images identifying the occupied area, the height map, the walls, and the position of ga…

2018-04-24abs ↗pdf ↗

Linear Discriminant Analysis (LDA) is a well-known method for dimensionality reduction and classification. Previous studies have also extended the binary-class case into multi-classes. However, many applications, such as object detection and keyframe extraction cannot provide consistent instance-label pairs, while LDA …

2013-09-21abs ↗pdf ↗

Hybrid models improve groundwater level prediction and uncertainty analysis.

problem Predicting and analyzing uncertainty of monthly groundwater levels.
method Six evolutionary optimization algorithms (GOA, CSO, WA, GA, KA, PSO) hybridized with ANFIS, ANN, and SVM.
result ANFIS-GOA outperformed other models in predicting groundwater levels.

In this paper, we use several techniques with conventional vocal feature extraction (MFCC, STFT), along with deep-learning approaches such as CNN, and also context-level analysis, by providing the textual data, and combining different approaches for improved emotion-level classification. We explore models that have not…

2019-05-19abs ↗pdf ↗

This paper detects function-level obfuscation in binary code using graph-based methods.

problem Detecting and characterizing function-level obfuscation in binary code.
method Graph-based approaches, including GNNs, are compared on various datasets.
result GNNs outperform baselines in function-level obfuscation detection, especially in a 11-class classification task.

This paper analyzes user-level local differential privacy in distributed systems.

problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.

The paper studies spectral analysis on complex spaces and finds explicit formulas for eigensections.

problem Understanding eigensections on complex projective spaces and Grassmannians.
method Using creation and annihilation operators, converting higher energy eigensections to lower energy holomorphic sections.
result Explicit formulas for the dimension of higher-level eigensections on Pn\mathbb{P}^{n}.

The paper breaks down AUC into cluster-level components for better model diagnostics.

problem Global AUC masks weaknesses in specific subpopulations, leading to financial or operational risks.
method Formal decomposition of AUC into intra- and inter-cluster components, comparing with other performance metrics.
result Allows practitioners to evaluate and diagnose model performance within and across clusters.

Study robust mean estimation under coordinate-level corruptions using Hamming distance.

problem Robust mean estimation under realistic coordinate-level corruptions.
method Introduce a novel Hamming distance-based measure and present information-theoretic analysis.
result Data cleaning-inspired approaches can match information theoretic bounds for robust mean estimation.

We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves bett…

2012-04-29abs ↗pdf ↗

The statistical properties of a stochastic process may be described (1)by the expectation values of the observables, (2)by the probability distribution functions or (3)by probability measures on path space. Here an analysis of level (3) is carried out for market fluctuation processes. Gibbs measures and chains with com…

2001-02-16abs ↗pdf ↗

The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an almost arbitrary level set estimator to estimate the smallest level at which th…

2014-09-30abs ↗pdf ↗

Improved penalty-based methods for bilevel optimization with reduced complexity.

problem Suboptimal complexity in solving bilevel optimization problems with large penalty terms.
method Novel penalty reformulation that decouples upper and lower-level variables, enabling larger step sizes and reduced iteration complexity.
result PBGD-Free algorithm that avoids inner loops for coupled constraint BLO problems, with reduced iteration complexity.