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

18355370 · Oct 201919922001200920172026
48 results for visual clarity

This research optimizes Andrews plots for better visual clarity in high-dimensional data.

problem Visualizing high-dimensional datasets with clarity and aesthetics.
method Developed a method to add spectral smoothing to Andrews plots to reduce visual clutter.
result Optimal spatial-spectral smoothing leads to more aesthetically pleasing and clutter-free visualizations.

Study evaluates interpretability of time series foundation models' latent spaces.

problem Improving interpretability of latent spaces in time series models for visual analytics.
method Evaluated MOMENT family of transformer-based models on five datasets, fine-tuning for performance.
result Fine-tuning improved latent space clarity but limited interpretability remained.

CLARITY compares dissimilar datasets, identifying structural and relationship inconsistencies.

problem Integrating qualitatively different datasets from various disciplines.
method Non-parametric approach decomposing similarities into structural and relationship components.
result Identifies and interprets inconsistencies between datasets.

Improved 3D ECG feature attributions for clinical interpretation.

problem Lack of interpretability in deep learning models for 12-lead ECG analysis.
method Cross-modal mapping of feature attributions from 12-lead ECG models onto CineECG 3D space.
result Mapped feature attributions yield higher Dice scores than standard 12-lead attributions.

The goal of this document is to provide a pedagogical introduction to the main concepts underpinning the training of deep neural networks using gradient descent; a process known as backpropagation. Although we focus on a very influential class of architectures called "convolutional neural networks" (CNNs) the approach …

2018-11-29abs ↗pdf ↗

The causal assumptions, the study design and the data are the elements required for scientific inference in empirical research. The research is adequately communicated only if all of these elements and their relations are described precisely. Causal models with design describe the study design and the missing data mech…

2012-11-13abs ↗pdf ↗

Moment Pooling reduces latent space dimensions in machine learning models.

problem High-dimensional latent spaces in machine learning models are hard to interpret.
method Moment Pooling extends Deep Sets networks to arbitrary multivariate moments.
result Latent dimensions as small as 1 can achieve similar performance to higher dimensions.

These lectures were a part of the geometry course held during the Fall 2011 Mathematics Advanced Study Semesters (MASS) Program at Penn State (\url{http://www.math.psu.edu/mass/}). The lectures are meant to be accessible to advanced undergraduate and early graduate students in mathematics. We have placed a great emphas…

2014-05-26abs ↗pdf ↗

We define transit clusters to simplify causal diagrams and preserve their essential properties.

problem Clustering variables in causal diagrams can alter essential properties of causal effects.
method We define transit clusters and provide an algorithm to find them, ensuring they preserve causal effect identifiability.
result Transit clusters simplify causal effect identification and maintain their essential properties.

Method improves clarity in forecasting spatio-temporal data.

problem Forecasting spatio-temporal data with clarity and interpretability.
method Supervised semi-nonnegative matrix factorization with frequency regularization.
result Method offers clearer interpretability in forecasting spatio-temporal data.

GCAO improves clustering of high-dimensional data by grouping low-density boundary points.

problem Stability and accuracy of clustering in high-dimensional, non-uniform data.
method Group-level optimization with gravitational attraction and optimization.
result GCAO outperforms 11 clustering methods on multiple datasets.

We present a theoretical framework of probabilistic learning derived by Maximum Probability (MP) Theorem shown in the current paper. In this probabilistic framework, a model is defined as an event in the probability space, and a model or the associated event -- either the true underlying model or the parameterized mode…

2019-10-21abs ↗pdf ↗

We consider a natural Riemannian metric on the infinite dimensional manifold of all embeddings from a manifold into a Riemannian manifold, and derive its geodesic equation in the case $\Emb(\Bbb R,\Bbb R)$ which turns out to be Burgers' equation. Then we derive the geodesic equation, the curvature, and the Jacobi equat…

1998-01-26abs ↗pdf ↗

We provide equivalence of numerous no-free-lunch type conditions for financial markets where the asset prices are modeled as exponential Levy processes, under possible convex constraints in the use of investment strategies. The general message is the following: if any kind of free lunch exists in these models it has to…

2008-03-14abs ↗pdf ↗

We propose an efficient algorithm for the generalized sparse coding (SC) inference problem. The proposed framework applies to both the single dictionary setting, where each data point is represented as a sparse combination of the columns of one dictionary matrix, as well as the multiple dictionary setting as given in m…

2018-02-13abs ↗pdf ↗

We investigate several confounding factors in the evaluation of optimization algorithms for deep learning. Primarily, we take a deeper look at how adaptive gradient methods interact with the learning rate schedule, a notoriously difficult-to-tune hyperparameter which has dramatic effects on the convergence and generali…

2020-02-26abs ↗pdf ↗

We conduct a study of the aliased spectral densities of Matérn covariance functions on a regular grid of points, providing clarity on the properties of a popular approximation based on stochastic partial differential equations; while others have shown that it can approximate the covariance function well, we find that i…

2019-12-26abs ↗pdf ↗

This paper simplifies the Nash Bargaining Solution for use in intellectual property cases.

problem Limited application of Nash Bargaining Solution in assigning intellectual property damages.
method Normalizes the Nash Bargaining Solution and provides a methodology for determining bargaining weight.
result Clarifies the application of Nash Bargaining Solution to specific case facts.

In this paper, we review or introduce several differential structures on manifolds in the general setting of real and complex differential geometry, and apply this study to Teichmüller theory. We focus on bi-Lagrangian i.e. para-Kähler structures, which consist of a symplectic form and a pair of transverse Lagrangian f…

2017-08-30abs ↗pdf ↗

Proposes a spectral method to assess and combine multiple data visualizations.

problem Evaluating and combining the strengths of different data visualization algorithms.
method Spectral method for assessing and combining multiple visualizations.
result Proposes a visualization eigenscore to quantify relative performance and a consensus visualization.

The counting grid is a grid of microtopics, sparse word/feature distributions. The generative model associated with the grid does not use these microtopics individually. Rather, it groups them in overlapping rectangular windows and uses these grouped microtopics as either mixture or admixture components. This paper bui…

2015-03-12abs ↗pdf ↗

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.

Given functional data from a survival process with time-dependent covariates, we derive a smooth convex representation for its nonparametric log-likelihood functional and obtain its functional gradient. From this, we devise a generic gradient boosting procedure for estimating the hazard function nonparametrically. An i…

2017-01-27abs ↗pdf ↗

This paper discusses the role of risk communication in macroprudential oversight and of visualization in risk communication. Beyond the soar in data availability and precision, the transition from firm-centric to system-wide supervision imposes vast data needs. Moreover, except for internal communication as in any orga…

2014-04-17abs ↗pdf ↗

Paper establishes baselines for offline RL from visual observations.

problem Challenges in offline reinforcement learning from visual observations with continuous action spaces.
method Simple baselines and benchmarking tasks for offline RL from visual observations.
result Simple modifications to existing online RL algorithms outperform existing offline RL methods.

We introduce the notion of the visual core of a hyperbolic 3-manifold N and explore its basic properties. The visual core can be thought of as a harmonic analysis analogue of the convex core. We investigate circumstances in which the visual core of a cover N' of N embeds under the covering map from N' to N. We apply th…

1999-03-12abs ↗pdf ↗

A novel method visualizes higher-dimensional spaces using hyperbolic geometry.

problem Challenges in visualizing higher-dimensional spaces.
method Interactive visualization of higher-dimensional grids based on hyperbolic geometry.
result Our method shows the whole higher-dimensional space at once and avoids disadvantages of previous methods.

Fidel-TS creates a new benchmark for time series forecasting models.

problem Lack of high-quality benchmarks for time series forecasting models.
method Formalized high-fidelity benchmark principles, including data sourcing integrity, leak-free design, and structural clarity. Created Fidel-TS, a new large-scale benchmark.
result Demonstrated the limitations of prior benchmarks and potential discrepancies in model evaluation.

Local surrogate explainers vary in objectives, leading to incomparable explanations.

problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.

We present GraphTSNE, a novel visualization technique for graph-structured data based on t-SNE. The growing interest in graph-structured data increases the importance of gaining human insight into such datasets by means of visualization. Among the most popular visualization techniques, classical t-SNE is not suitable o…

2019-04-15abs ↗pdf ↗

Developing a visual platform for faster astronomical source cataloging.

problem Speeding up cataloging of large area surveys in radio astronomy.
method Integration of advanced source finding and classification tools into a visual analytic platform.
result Improvement and acceleration of cataloging process in astronomical surveys.