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

Trend · papers per month

4183124165 · Jun 202019922001200920172026
48 results for fractional convolution

Study approximates weak error for specific stochastic models with rough and Gaussian mean-reverting volatility.

problem Approximating weak error for specific stochastic models with rough and Gaussian mean-reverting volatility.
method Used Euler type scheme with integrated kernels to study weak convergence rate.
result Obtained weak convergence rate of min(3α1,1)\min(3α-1,1) for discretised rough Ornstein-Uhlenbeck process and stochastic rough volatility model.

The study quantifies how many objects can be linearly classified under all views.

problem Understanding the expressivity of group-equivariant representations.
method Generalization of Cover's Function Counting Theorem to quantify separable dichotomies.
result The fraction of separable dichotomies is determined by the fixed space dimension of the group action.

This study compares RNN and CNN for predicting wave propagation using the Saint-Venant equations.

problem Predicting wave propagation over long time periods using deep learning.
method Investigated recurrent and convolutional neural networks for their performance in predicting surface waves governed by the Saint-Venant equations.
result Convolutional networks perform at least as well as recurrent networks in predicting wave propagation.

ThriftyNet uses a single convolutional layer recursively to maximize parameter usage.

problem Maximizing the use of parameters in deep convolutional neural networks.
method A single convolutional layer is used recursively, with normalization, non-linearities, downsampling, and shortcuts to maintain model expressivity.
result ThriftyNet achieves competitive performance with significantly fewer parameters.

Paper analyzes and improves graph convolutional networks for node classification.

problem Over-smoothing in GCNs causes poor performance in node classification tasks.
method Interpreted GCNs from an optimization perspective, introduced metrics to measure over-smoothing, derived a new kernel GCN+.
result GCN+ reduces over-smoothing and improves node classification performance.

The paper defines and analyzes set-valued stochastic integrals for Lévy processes.

problem Defining and analyzing set-valued stochastic integrals for Lévy processes.
method Extending classical definitions to convoluted integrals with square-integrable kernels, and proving properties of set-valued convoluted stochastic integrals.
result Set-valued convoluted stochastic integrals can be explosive and take extended vector values.

Paper proposes a new LSTM model for spatio-temporal learning.

problem Challenging video tasks require learning long-term spatio-temporal correlations.
method Introduces a higher-order convolutional LSTM model with tensor train decomposition.
result Model achieves state-of-the-art performance with significantly fewer parameters.

Deep neural networks estimate long memory parameters efficiently.

problem Estimating long memory parameters in stochastic processes.
method Scale-invariant 1D Convolutional Neural Networks (CNNs) and Long Short-Term Memory (LSTM) models trained with synthetic data.
result Neural models outperform conventional methods in precision, speed, consistency, and robustness.

Improved model for non-smooth signals with complex spectra.

problem Current models struggle with non-smooth signals and complex spectral structures.
method CGPCM and RGPCM models with causality and Bayesian nonparametric interpretations, improved variational inference.
result Proposed models show better performance on synthetic and real-world data.

New method transforms complex stochastic equations into simpler ones for efficient simulation.

problem Efficient simulation of complex path-dependent stochastic processes.
method Transforms Volterra-type SDEs into standard diffusion processes using convolution kernels.
result Proposes a numerical simulation scheme with a strong convergence rate of 1/2.

Convolutional Bayesian filtering generalizes state estimation by incorporating inequality conditions.

problem Standard Bayesian filtering assumes exact conditional probabilities, limiting its applicability.
method Introducing inequality conditions transforms conditional probabilities into convolutional forms, expanding the filtering framework.
result Convolutional Bayesian filtering encompasses standard Bayesian filtering and allows for more nuanced model consideration.

Convolution is a central operation in Convolutional Neural Networks (CNNs), which applies a kernel to overlapping regions shifted across the image. However, because of the strong correlations in real-world image data, convolutional kernels are in effect re-learning redundant data. In this work, we show that this redund…

2019-05-28abs ↗pdf ↗

Phase segregation, the process by which the components of a binary mixture spontaneously separate, is a key process in the evolution and design of many chemical, mechanical, and biological systems. In this work, we present a data-driven approach for the learning, modeling, and prediction of phase segregation. A direct …

2018-03-23abs ↗pdf ↗

SigMA uses signatures and attention to estimate parameters in fBm-driven SDEs.

problem Estimating parameters in SDEs driven by fBm is challenging due to non-Markovian and semimartingale issues.
method SigMA integrates path signatures with multi-head self-attention, using convolutional and MLP layers.
result SigMA outperforms other methods in accuracy, robustness, and model compactness.

DFS dynamically decides bitwidths for layers to balance accuracy and efficiency.

problem Balancing model accuracy and inference speed for deep networks.
method Dynamic Fractional Skipping (DFS) framework that assigns bitwidths to layers for input-adaptive inference.
result DFS achieves superior tradeoff between computational cost and model accuracy.

Automated protein structure prediction from cryo-EM data.

problem Challenging to build atomic models from cryo-EM densities without prior structure.
method Uses GCN and LSTM to automate model building from amino acid identities and candidate locations.
result Automated approach reduces time and eliminates human intervention for protein structure determination.

MultiRocket boosts TSC speed and accuracy with pooling and transformations.

problem Efficient time series classification with high accuracy.
method Multiple pooling operators and transformations applied to raw and differenced series.
result MultiRocket outperforms MiniRocket and is competitive with state-of-the-art methods in terms of accuracy and speed.

In this work we present a new approach on studying dynamical systems. Combining the two ways of expressing the uncertainty, using probabilistic theory and credibility theory, we have research the generalized fractional hybrid equations. We have introduced the concepts of generalized fractional Wiener process, generaliz…

2009-09-15abs ↗pdf ↗

GNNs improve semi-supervised node regression, but why? We explain.

problem Understanding when and why GNNs succeed in semi-supervised node regression.
method Aggregate-and-readout model encompassing message passing architectures, least-squares estimation over GNNs with linear graph convolutions and a deep ReLU readout.
result Sharp non-asymptotic risk bound separating approximation, stochastic, and optimization errors.

New algorithms achieve optimal robustness in stochastic convex optimization under contamination.

problem Determining optimal rates for robust stochastic convex optimization under εε-contamination.
method Developed novel algorithms achieving minimax-optimal excess risk under εε-contamination model without stringent assumptions.
result Achieved minimax-optimal excess risk (up to logarithmic factors) under εε-contamination model.

We propose an incremental training method that partitions the original network into sub-networks, which are then gradually incorporated in the running network during the training process. To allow for a smooth dynamic growth of the network, we introduce a look-ahead initialization that outperforms the random initializa…

2018-03-27abs ↗pdf ↗

Introduces fractional k-dimensional measure bridging fractional length and area.

problem Defining fractional measures for dimensions between 0 and n-1.
method Introduces a parameterized fractional measure σσ that converges to Hausdorff measure.
result Fractional measure converges to Hausdorff measure with a known constant factor.

The theory of derivative of noninteger order goes back to Leibniz, Liouville and Riemann. Derivatives of fractional order have found many applications in recent studies in mechanics, physics, economics. In this paper we define the fractional tangent bundle on a manifold, using a method of Radu Miron. The fractional Lei…

2007-09-15abs ↗pdf ↗

Let SgS_g be a closed orientable surface of genus g2g \geq 2 and CC a simple closed nonseparating curve in FF. Let tCt_C denote a left handed Dehn twist about CC. A \textit{fractional power} of tCt_C of \textit{exponent} $\fraction{\ell}{n}$ is an $h \in \Mod(S_g)$ such that hn=tCh^n = t_C^{\ell}. Unlike a root of a $t…

2012-07-16abs ↗pdf ↗

We formulate the fractional Ricci flow theory for (pseudo) Riemannian geometries enabled with nonholonomic distributions defining fractional integro-differential structures, for non-integer dimensions. There are constructed fractional analogs of Perelman's functionals and derived the corresponding fractional evolution …

2010-04-05abs ↗pdf ↗

We propose a new model for unsupervised document embedding. Leading existing approaches either require complex inference or use recurrent neural networks (RNN) that are difficult to parallelize. We take a different route and develop a convolutional neural network (CNN) embedding model. Our CNN architecture is fully par…

2017-11-11abs ↗pdf ↗

Modeling financial markets with memory using fractional calculus and Brownian motion.

problem Capturing memory effects in financial markets using stochastic models.
method Fractional Langevin equation with colored noise generated by fractional Brownian motion.
result Anomalous marginal glass phase observed in some regions of the system.

In this paper we established the condition for a curve to satisfy stochas- tic fractional HP (Hamilton-Pontryagin) equations. These equations are described using It^o integral. We have also considered the case of stochastic fractional Hamiltonian equa- tions, for a hyperregular Lagrange function. From the stochastic fr…

2009-06-24abs ↗pdf ↗

Extends fractional LpL^p uncertainty principles with extremizers and stability results.

problem Investigating uncertainty principles in fractional LpL^p settings.
method Analyzing the fractional Schrödinger equation to find extremal functions and sharp constants.
result Proves stability of extremizers for fractional uncertainty inequalities.

Approximates derivative pricing under fractional stochastic volatility.

problem Derivative pricing under fractional stochastic volatility model.
method Approximate expression derived from deterministic functions and fractional Ornstein-Uhlenbeck process.
result Numerical simulations show the feasibility and effect of long-range dependencies on derivative prices.

New method uses fractional posteriors for semiparametric inference with improved uncertainty quantification.

problem Semiparametric inference with nonparametric priors and fractional posteriors.
method Established a general Bernstein--von Mises theorem for fractional posterior distributions, proposed shifted-and-rescaled credible sets.
result Fractional posterior credible sets provide reliable uncertainty quantification but have inflated size; shifted-and-rescaled set is an efficient confidence set.

Graph convolution networks (GCN) have emerged as the leading method to classify node classes in networks, and have reached the highest accuracy in multiple node classification tasks. In the absence of available tagged samples, active learning methods have been developed to obtain the highest accuracy using the minimal …

2019-06-20abs ↗pdf ↗

New measure predicts deep neural network generalization better than existing ones.

problem Existing measures fail to explain generalization in overparameterized deep networks.
method Introduce prunability: smallest fraction of parameters that can be pruned without loss increase.
result Prunability highly correlates with generalization performance across various networks.

In this paper we introduce a link between geometry of ordinary continued fractions and trajectories of points that moves according to the second Kepler law. We expand geometric interpretation of ordinary continued fractions to the case of continued fractions with arbitrary elements.

2009-11-14abs ↗pdf ↗