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

200400599799 · Jun 202019922001200920172026
48 results for dissection optimization

An involutive diffeomorphism σσ of a connected smooth manifold MM is called dissecting if the complement of its fixed point set is not connected. Dissecting involutions on a complete Riemannian manifold are closely related to constructive quantum field theory through the work of Dimock and Jaffe/Ritter on the constru…

2019-07-17abs ↗pdf ↗

Study predicts risk of true-lumen narrowing after ATAAD surgery using CT data.

problem Early post-surgery risk assessment for aortic dissection patients.
method Retrospective study with CT data, derived cross-sectional shapes, form factor (FF) for morphology assessment, linear discriminant analysis (LDA) for risk classification, LOPO-CV for prediction.
result Machine-learning model accurately predicts risk for all high-risk patients and low-risk patients, potentially reducing hospital visits.

Modeling aortic wall inhomogeneities to predict dissection risks.

problem Predicting localized stress accumulations in the aortic wall due to inhomogeneities.
method Stochastic constitutive model with random field realizations, coupled with a convolutional neural network surrogate.
result The neural network accurately predicts stress distributions and assesses uncertainty in aortic wall stress.

The self intersection of an immersion i : S^2 \to R^3 dissects S^2 into pieces which are planar surfaces (unless i is an embedding). In this work we determine what collections of planar surfaces may be obtained in this way. In particular, for every n we construct an immersion i : S^2 \to R^3 with 2n triple points, for …

2006-12-27abs ↗pdf ↗

This work makes vision networks more interpretable by identifying key neurons.

problem Complex deep networks are hard to interpret, hindering safety-critical applications.
method Uses stochastic local competition and multimodal models to dissect and interpret neurons.
result The method generates understandable descriptions for a few active neurons, revealing network decision-making.

The vast majority of market impact studies assess each product individually, and the interactions between the different order flows are disregarded. This strong approximation may lead to an underestimation of trading costs and possible contagion effects. Transactions in fact mediate a significant part of the correlatio…

2016-09-08abs ↗pdf ↗

Pruning is a standard technique for removing unnecessary structure from a neural network to reduce its storage footprint, computational demands, or energy consumption. Pruning can reduce the parameter-counts of many state-of-the-art neural networks by an order of magnitude without compromising accuracy, meaning these n…

2019-06-29abs ↗pdf ↗

This work investigates implicit bias in multiclass separable data using a novel geometry-aware optimizer.

problem Understanding implicit bias in overparameterized models on multiclass separable data.
method Introduces NucGD, a geometry-aware optimizer enforcing low-rank structures through nuclear norm constraints.
result NucGD enables scalable training and characterizes the impact of stochastic optimization dynamics.

CADO optimizes heatmap-based solvers for cost minimization, overcoming performance limitations.

problem Heatmap-based solvers lack objective alignment for cost minimization.
method CADO uses Reinforcement Learning to optimize solution cost directly, introducing Label-Centered Reward and Hybrid Fine-Tuning.
result CADO achieves state-of-the-art performance across diverse benchmarks.

Continuous deep learning architectures have recently re-emerged as Neural Ordinary Differential Equations (Neural ODEs). This infinite-depth approach theoretically bridges the gap between deep learning and dynamical systems, offering a novel perspective. However, deciphering the inner working of these models is still a…

2020-02-19abs ↗pdf ↗

This paper analyzes tokenized U.S. Treasuries, revealing patterns and roles in blockchain transactions.

problem Limited empirical analysis of transaction-level behaviors in tokenized U.S. Treasuries.
method Quantitative dissection of U.S. Treasury-backed RWA tokens across multiple chains, introducing a curvature-aware representation learning model for address-level economic role inference.
result Decoded transaction-level patterns reveal the degree of retail participation and distinguish roles in Web3 finance.

This work shows that supervised contrastive learning achieves similar results to cross-entropy but requires more iterations.

problem The question of whether there are fundamental differences in representation geometry between supervised contrastive learning and cross-entropy.
method The authors prove that both losses attain their minimum when representations of each class collapse to the vertices of a regular simplex, and they empirically validate this finding.
result Supervised contrastive learning requires more iterations to reach a close-to-optimal state compared to cross-entropy, indicating different optimization behavior.

In his stimulating article on the reasons for two puzzling observations about the behaviour of interest rates, exchange rates and the rate of inflation, Charles Engel (2016) puts forward an explanation that rests on the concept of a non-pecuniary liquidity return on assets. Albeit intriguing the analysis struggles to a…

2016-04-29abs ↗pdf ↗

TNDE quantifies dynamic gene drivers from single-cell snapshots.

problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.

Improved conformal prediction for better conditional coverage of classifier predictions.

problem Achieving exact conditional coverage in finite samples for prediction sets.
method Developed a variant of conformal prediction targeting coverage conditional on confidence and trust score.
result Empirically improved conditional coverage properties compared to standard conformal prediction.

Survey of performative prediction, a machine learning setup causing distribution shifts.

problem Machine learning models causing shifts in the environment they predict.
method Classification of performative prediction settings based on distribution map information.
result Introduction of new solution concepts and theoretical analyses.

iCOS method estimates risk-neutral densities and option prices without model assumptions.

problem Estimating risk-neutral densities and option prices without model assumptions.
method Leverages Fourier-cosine technique using option-implied cosine series coefficients, without model assumptions.
result Effective in extracting information from option prices under various market conditions.

Stochastic partition models tailor a product space into a number of rectangular regions such that the data within each region exhibit certain types of homogeneity. Due to constraints of partition strategy, existing models may cause unnecessary dissections in sparse regions when fitting data in dense regions. To allevia…

2016-05-23abs ↗pdf ↗

Ambrose, Palais and Singer \cite{Ambrose} introduced the concept of second order structures on finite dimensional manifolds. Kumar and Viswanath \cite{Kumar} extended these results to the category of Banach manifolds. In the present paper all of these results are generalized to a large class of Frechet manifolds. It is…

2008-10-29abs ↗pdf ↗

Cryptocurrencies return cross-predictability and technological similarity yield information on risk propagation and market segmentation. To investigate these effects, we build a time-varying network for cryptocurrencies, based on the evolution of return cross-predictability and technological similarities. We develop a …

2018-02-11abs ↗pdf ↗

We introduce an event based framework of directional changes and overshoots to map continuous financial data into the so-called Intrinsic Network - a state based discretisation of intrinsically dissected time series. Defining a method for state contraction of Intrinsic Network, we show that it has a consistent hierarch…

2014-02-10abs ↗pdf ↗

It has been widely assumed that a neural network cannot be recovered from its outputs, as the network depends on its parameters in a highly nonlinear way. Here, we prove that in fact it is often possible to identify the architecture, weights, and biases of an unknown deep ReLU network by observing only its output. Ever…

2019-10-02abs ↗pdf ↗

By analyzing a large data set of daily returns with data clustering technique, we identify economic sectors as clusters of assets with a similar economic dynamics. The sector size distribution follows Zipf's law. Secondly, we find that patterns of daily market-wide economic activity cluster into classes that can be ide…

2002-07-05abs ↗pdf ↗

In the first part Busemann concavity as non-negative curvature is introduced and a bi-Lipschitz splitting theorem is shown. Furthermore, if the Hausdorff measure of a Busemann concave space is non-trivial then the space is doubling and satisfies a Poincaré condition and the measure contraction property. Using a compari…

2016-01-13abs ↗pdf ↗

Sparse Transformers degrade semantic information first, with early layers encoding more.

problem Understanding how sparse Transformers affect learned representations and semantic information.
method Probed Transformers with progressively pruned weights to observe changes in semantic information and model behavior.
result Complex semantic information is first to degrade in sparse Transformers, with early layers encoding more.

Deep neural networks (DNNs) can easily fit a random labeling of the training data with zero training error. What is the difference between DNNs trained with random labels and the ones trained with true labels? Our paper answers this question with two contributions. First, we study the memorization properties of DNNs. O…

2019-11-21abs ↗pdf ↗

In exchange for large quantities of data and processing power, deep neural networks have yielded models that provide state of the art predication capabilities in many fields. However, a lack of strong guarantees on their behaviour have raised concerns over their use in safety-critical applications. A first step to unde…

2019-10-09abs ↗pdf ↗

Paper quantifies epistemic uncertainty in deep learning.

problem Uncertainty in deep learning models, especially epistemic uncertainty.
method Dissects epistemic uncertainty into procedural and data variability, proposes estimation methods.
result Demonstrates how proposed methods overcome computational challenges and provide guidance for modeling and data collection.

AI agents in experimental markets exhibit behavioral patterns that aggregate into market dynamics.

problem Understanding AI trading behavior and its impact on market dynamics.
method Experimental asset markets populated by AI agents trained on Large Language Models (LLMs).
result AI agents' behavior leads to market dynamics similar to human traders, including bubbles.

The paper explains how ReLU nets converge globally in high dimensions without strict assumptions.

problem Understanding global convergence of ReLU nets in very high dimensions.
method Fine-grained analysis of random activation matrices and detailed gradient norm and curvature analysis.
result Empirical loss function has favorable geometrical properties in the overparameterized setting.

Deep RL algorithms can overfit to early experiences, leading to poor performance.

problem Overfitting to early interactions in deep reinforcement learning.
method Proposed a mechanism to periodically reset part of the agent to mitigate overfitting.
result Periodic resetting improves performance in both discrete and continuous action domains.