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

15314661 · Nov 201919922001200920172026
48 results for RDS filtering

Extended RDS filtering for positions and orientations, improving crossing structure enhancement and inpainting.

problem Enhancing and inpainting images with crossing structures.
method Extended RDS filtering to M2\mathbb{M}_2 space, using gauge frames to mitigate issues.
result RDS filtering outperforms existing techniques in denoising and inpainting images with crossing structures.

Extends RDS filtering to position-orientation space for better image processing.

problem Enhancing and inpainting images with crossing structures.
method Created a version of RDS filtering using gauge frames, studying generalised diffusion.
result RDS filtering on position-orientation space improves denoising and inpainting of crossing structures.

This work evaluates deep generative models using RD curves, providing a more comprehensive quality assessment.

problem Quantitative evaluation of deep generative models is challenging, especially for implicit models.
method Proposes using rate distortion (RD) curves to evaluate and compare deep generative models, approximating the entire curve with similar computations to log-likelihood estimation.
result Approximating the entire RD curve provides a more comprehensive quality assessment than scalar-valued metrics.

Proposes a new learning method for RBMs that combines strengths of forward and reverse KLD.

problem Underfitting and mode-collapse issues in RBM learning.
method Ratio divergence learning using target energy.
result Significantly outperforms other learning methods in energy function fitting, mode-covering, and stability.

Modified BA algorithm computes RD and DR functions efficiently.

problem Computing rate-distortion and distortion-rate functions.
method A novel modification of the BA algorithm using Newton's method for root-finding.
result The modified algorithm converges to RD and DR function solutions with rate O(1/n)O(1/n) and provides ε\varepsilon-approximations.

C3 compresses images and videos with low complexity and high performance.

problem High complexity and low performance in neural compression models.
method Overfits a small model to each image or video separately, improving RD performance with low complexity.
result Matches the RD performance of state-of-the-art neural and video codecs with significantly lower decoding complexity.

RD-Agent(Q) automates quantitative finance research and development.

problem Challenges in asset return prediction due to high dimensionality and volatility.
method Data-centric multi-agent framework for automated research and development of quantitative strategies.
result Up to 2X higher annualized returns with 70% fewer factors.

Algorithm uncovers treatment effect heterogeneity in educational RD designs.

problem Discovering sources of treatment effect heterogeneity in regression discontinuity designs.
method Causal supervised machine learning algorithm to build a 'regression discontinuity tree'.
result Algorithm uncovers various sources of heterogeneity in the impact of attending a better secondary school.

SciRE-Solver accelerates DMs sampling by recursively calculating the score function derivative.

problem Slow iterative process of diffusion models due to estimating the score function derivative.
method Recursive Difference (RD) method combined with truncated Taylor expansion of score-integrand.
result SciRE-Solver achieves state-of-the-art FIDs with significantly fewer score function evaluations.

This paper proposes RDS to improve model diversity in data sampling.

problem Data selection process can lead to performance issues in machine learning models.
method Formulates optimisation problem for model diversification, introduces diverse base learners and ensemble reward mechanisms.
result RDS method enhances model performance on various datasets.

Extends likelihood ratio exponential families to analyze various optimization methods.

problem Analyzing optimization methods like rate-distortion and information bottleneck.
method Linking geometric mixture paths to exponential families and using hypothesis testing.
result Provides a common mathematical framework for understanding these methods.

We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rd poly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed sensing: recovering a sparse vector from a few of its Fourier coeffic…

2011-03-14abs ↗pdf ↗

Bayesian estimators for causal inference using hierarchical Gaussian Processes.

problem Estimating causal effects in sharp and fuzzy RD/RK designs.
method Hierarchical Gaussian Process models for regression and classification.
result Hierarchical GP models improve precision and coverage of RD/RK estimations.

Let MM be a complete connected Riemannian manifold of finite volume. In this paper we present a new method of constructing classes in bounded cohomology of transformation groups such as Homeo0(M,μ)Homeo_0(M,μ), Diff0(M,vol)Diff_0(M,vol) and Symp0(M,ω)Symp_0(M,ω) (in case MM is symplectic). As an application we show that, under certain conditio…

2019-02-28abs ↗pdf ↗

In this study, we have identified V3V_3 slant helix (2nd2^{nd} type slant helix, V5V_5 slant helix (3rd3^{rd} type slant helix) and attained some characteristic properties in the Euclidean 5-Space E5E^5. In addition to this, we have proven that there are no other helices other than V1V_1 helix (inclined curve), V3V_3 sla…

2014-02-13abs ↗pdf ↗

In real-world and online social networks, individuals receive and transmit information in real time. Cascading information transmissions (e.g. phone calls, text messages, social media posts) may be understood as a realization of a diffusion process operating on the network, and its branching path can be represented by …

2016-03-29abs ↗pdf ↗

We describe a simple locally CAT(0) classifying space for extra extra large type Artin groups (with all labels at least 5). Furthermore, when the Artin group is not dihedral, we describe a rank 1 periodic geodesic, thus proving that extra large type Artin groups are acylindrically hyperbolic. Together with Property RD …

2019-05-27abs ↗pdf ↗

Paper proves Gromov's conjecture on manifolds with certain group properties.

problem Gromov's conjecture on positive scalar curvature and simplicial volume.
method Proves conjecture under a fundamental group decay property.
result Proves Gromov's conjecture for manifolds with a weakened rapid decay property.

The purpose of this paper is to identify a relevant statistical correlation between rate of default, RD, and loss given default, LGD, in a major Brazilian financial institution Retail Home Equity exposure rated using the IRB approach, so that we may find a causal relationship between the two risk parameters. Therefore,…

2014-08-03abs ↗pdf ↗

This study explains how adversarial interaction creates non-homogeneous patterns using a pseudo-Reaction-Diffusion model.

problem Understanding how adversarial interaction leads to non-homogeneous patterns in systems.
method Developed a pseudo-Reaction-Diffusion model to explain the mechanism.
result Turing instability is involved in creating non-homogeneous patterns.

In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed a large gap between estimation with unbounded computational resources (using, for instance, tensor nuclear norm minimization) and polynomial…

2016-12-23abs ↗pdf ↗

Strong bolicity helps prove Baum-Connes conjecture for certain hyperbolic groups.

problem Proving the Baum-Connes conjecture for relatively hyperbolic groups.
method Constructing a strongly bolic metric and using masks for random coset representatives.
result Deduced the Baum-Connes conjecture for groups satisfying (RD) and certain parabolics.

We show that a car, viewed as a nonholonomic system, provides an example of a flat parabolic geometry of type (SO(2,3),P12)({\bf SO}(2,3),P_{12}), where P12P_{12} is a Borel parabolic subgroup in SO(2,3){\bf SO}(2,3). We discuss the relations of this geometry of a car with the geometry of circles in the plane (a low dimensional Lie sph…

2019-08-03abs ↗pdf ↗

Paper models and compresses wideband CSI feedback in FDD MIMO systems.

problem Fundamental limits of channel state information (CSI) feedback in FDD massive MIMO systems.
method Modeling CSI as a Gaussian-mixture source with latent geometry states, proposing Gaussian-mixture transform coding (GMTC).
result Near-optimal CSI compression achieved through state-adaptive transform coding without large neural encoders.

The paper studies third-order PDEs invariant under affine transformations and connects them to the Fubini-Pick invariant.

problem Investigating third-order PDEs invariant under affine transformations.
method Using a general method introduced in [D.V. Alekseevsky, J. Gutt, G. Manno, and G. Moreno: A general method to construct invariant PDEs on homogeneous manifolds].
result Derives third-order PDEs from the Fubini-Pick invariant.

This paper explores the capabilities of convolutional neural networks to deal with a task that is easily manageable for humans: perceiving 3D pose of a human body from varying angles. However, in our approach, we are restricted to using a monocular vision system. For this purpose, we apply a convolutional neural networ…

2016-08-31abs ↗pdf ↗

This paper focuses on spectral filters on graphs, namely filters defined as elementwise multiplication in the frequency domain of a graph. In many graph signal processing settings, it is important to transfer a filter from one graph to another. One example is in graph convolutional neural networks (ConvNets), where the…

2019-01-29abs ↗pdf ↗

Let G be a Lie group with finitely many connected components and let K be a maximal compact subgroup. We assume that G satisfies the rapid decay (RD) property and that G/K has non-positive sectional curvature. As an example, we can take G to be a connected semisimple Lie group. Let M be a G-proper manifold with compact…

2018-01-20abs ↗pdf ↗

A new SOHP filter improves trend estimation in economic time series.

problem Improving trend estimation in nonlinear economic time series.
method Recursive application of one-sided HP filter on updated cyclical components, combined with an incremental HP filtering algorithm.
result Better performance of SOHP filter compared to other HP-type filters on real economic data.

Deep density methods improve filtering in high-dimensional systems.

problem Nonlinear filtering in high-dimensional systems.
method Two deep density methods based on Feynman-Kac formulas and neural networks.
result Logarithmic deep backward stochastic differential equation filter outperforms classical methods in high dimensions.

The sophisticated structure of Convolutional Neural Network (CNN) allows for outstanding performance, but at the cost of intensive computation. As significant redundancies inevitably present in such a structure, many works have been proposed to prune the convolutional filters for computation cost reduction. Although ex…

2018-10-12abs ↗pdf ↗

Study shows attention-style models learn pairwise interactions efficiently.

problem Learning pairwise interactions in attention-style models.
method Proved minimax rate of convergence for learning pairwise interactions.
result Minimax rate is M2β2β+1M^{-\frac{2β}{2β+1}} independent of embedding dimension and token number.

Hepworth, Willerton, Leinster and Shulman introduced the magnitude homology groups for enriched categories, in particular, for metric spaces. The purpose of this paper is to describe the magnitude homology group of a metric space in terms of order complexes of posets. In a metric space, an interval (the set of points b…

2018-02-28abs ↗pdf ↗

Gradient filters track moving parameters under noisy data and misspecification.

problem Tracking multidimensional time-varying parameters under noisy observations and model misspecification.
method Gradient-based filters update parameters using the gradient of a postulated objective function, evaluated at either the predicted or updated parameters.
result Novel sufficient conditions for exponential stability of the filtered parameter path, and finite-sample and asymptotic mean squared error bounds.

We simplify Bayesian filtering by framing it as optimization, making it practical for high-dimensional systems.

problem Bayesian filtering struggles in high-dimensional state spaces like neural networks.
method We frame Bayesian filtering as optimization, using gradient descent for nonlinear cases.
result Our method results in effective, robust, and scalable filters for high-dimensional systems.

Convolutional neural networks (CNNs) achieve state-of-the-art performance in a wide variety of tasks in computer vision. However, interpreting CNNs still remains a challenge. This is mainly due to the large number of parameters in these networks. Here, we investigate the role of compression and particularly pruning fil…

2017-11-07abs ↗pdf ↗

A novel method reduces dimensionality for filtering SRNs with observed variables.

problem Challenges in estimating hidden state variables in SRNs with limited observations.
method Filtered Markovian Projection (Filtered MP) for dimensionality reduction in filtering.
result Filtered MP guarantees consistency and superior computational efficiency in high dimensions.

New method filters large networks from financial data to reveal key subnetworks.

problem Filtering large dimensional networks to isolate key constituents.
method Exploits spectral properties of high-dimensional data networks, tuning for sparsity and consistency.
result Shows method can interpolate between zero and maximal filtering, preserving spectral properties.