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

4895143190 · Jun 202019922001200920172026
48 results for TAP groups

Derives TAP approximation for Bayesian linear regression.

problem Log-normalizing constant of posterior distribution in high-dimensional linear regression.
method Variational representation and Thouless-Anderson-Palmer approximation.
result Proves TAP approximation for spherical prior in proportional asymptotic regime.

Study shows TAP free energy minimization provides better posterior inference in high-dimensional linear models.

problem Deviation from true posterior mean and underestimation of posterior uncertainty in variational inference.
method Minimization of TAP free energy in a high-dimensional asymptotic framework, showing geometric and statistical properties.
result Local minimizer of TAP free energy provides consistent estimate of posterior marginals and correctly calibrated posterior inference.

Paper introduces TAP-Vid, a benchmark for tracking any point in videos.

problem Tackles the problem of tracking arbitrary physical points on surfaces over longer video clips.
method Formalizes the problem as TAP, introduces TAP-Vid benchmark, uses crowdsourced pipeline with optical flow estimates, proposes TAP-Net model.
result TAP-Net outperforms all prior methods on TAP-Vid benchmark when trained on synthetic data.

TAP transfers knowledge from unlabeled data to improve cross-modal learning.

problem Improving supervised learning performance using unlabeled data from a different modality.
method Probabilistic approach for missing information estimation, kernel regression, cross-attention module, TAP neural network.
result TAP significantly improves generalization across different domains and neural network architectures.

In the wake of the still ongoing global financial crisis, bank interdependencies have come into focus in trying to assess linkages among banks and systemic risk. To date, such analysis has largely been based on numerical data. By contrast, this study attempts to gain further insight into bank interconnections by tappin…

2014-06-30abs ↗pdf ↗

In the past 20 years, momentum or trend following strategies have become an established part of the investor toolbox. We introduce a new way of analyzing momentum strategies by looking at the information ratio (IR, average return divided by standard deviation). We calculate the theoretical IR of a momentum strategy, an…

2014-02-13abs ↗pdf ↗

Study free energy in spherical spin glasses, proving universality dichotomy.

problem Analyzing free energy in spherical spin glass models with different tail exponents.
method Introduced a tail-adapted normalization and used universality dichotomy.
result Sharp universality dichotomy for free energy across different tail exponents.

Physics-based deep learning improves fiber-optic communication efficiency.

problem Improving signal propagation in fiber-optic communication systems.
method Parameterizing the split-step method of solving the nonlinear Schrödinger equation as a deep neural network.
result Filters can be pruned to as few as 3 taps/step without sacrificing performance.

A novel approach is put forth that utilizes data similarity, quantified on a graph, to improve upon the reconstruction performance of principal component analysis. The tasks of data dimensionality reduction and reconstruction are formulated as graph filtering operations, that enable the exploitation of data node connec…

2018-09-25abs ↗pdf ↗

We propose a version of least-mean-square (LMS) algorithm for sparse system identification. Our algorithm called online linearized Bregman iteration (OLBI) is derived from minimizing the cumulative prediction error squared along with an l1-l2 norm regularizer. By systematically treating the non-differentiable regulariz…

2012-10-01abs ↗pdf ↗

Study on optimal rates for sequential probability assignment using smoothed analysis.

problem Optimal rates for sequential probability assignment under smoothed adversaries.
method General-purpose reduction from minimax rates to transductive learning, development of an efficient algorithm using MLE oracle.
result Optimal (logarithmic) fast rates for parametric and finite VC dimension classes, sublinear regret for general classes.

This manuscript introduces the idea of using Distributionally Robust Optimization (DRO) for the Counterfactual Risk Minimization (CRM) problem. Tapping into a rich existing literature, we show that DRO is a principled tool for counterfactual decision making. We also show that well-established solutions to the CRM probl…

2019-06-14abs ↗pdf ↗

Functional Magnetic Resonance Imaging (fMRI) relies on multi-step data processing pipelines to accurately determine brain activity; among them, the crucial step of spatial smoothing. These pipelines are commonly suboptimal, given the local optimisation strategy they use, treating each step in isolation. With the advent…

2017-10-02abs ↗pdf ↗

Paper presents efficient algorithms for convolutional neural networks using Winograd minimal filtering.

problem Resource-efficient implementation of convolutional neural networks.
method Winograd minimal filtering trick applied to M-tap filters (M=3,5,7,9,11) for parallel hardware implementation.
result Approximately 30% reduction in multipliers for fully parallel hardware implementation.

Prediction is arguably one of the most basic functions of an intelligent system. In general, the problem of predicting events in the future or between two waypoints is exceedingly difficult. However, most phenomena naturally pass through relatively predictable bottlenecks---while we cannot predict the precise trajector…

2018-08-23abs ↗pdf ↗

Dropout has recently emerged as a powerful and simple method for training neural networks preventing co-adaptation by stochastically omitting neurons. Dropout is currently not grounded in explicit modelling assumptions which so far has precluded its adoption in Bayesian modelling. Using Bayesian entropic reasoning we s…

2015-08-12abs ↗pdf ↗

The policy objective of safeguarding financial stability has stimulated a wave of research on systemic risk analytics, yet it still faces challenges in measurability. This paper models systemic risk by tapping into expert knowledge of financial supervisors. We decompose systemic risk into a number of interconnected seg…

2014-12-17abs ↗pdf ↗

We present a detailed study of the performance of a trading rule that uses moving average of past returns to predict future returns on stock indexes. Our main goal is to link performance and the stochastic process of the traded asset. Our study reports short, medium and long term effects by looking at the Sharpe ratio …

2019-06-29abs ↗pdf ↗

This paper tackles federated incremental learning with dynamic memory allocation for improved model performance in non-IID data.

problem Catastrophic forgetting in federated healthcare systems with non-IID data.
method Dynamic memory allocation strategy based on data replay mechanism.
result Significant performance improvements in medical image datasets compared to baseline models.

FLIX simplifies federated learning with efficient communication.

problem Handling constraints specific to federated learning.
method Introduces FLIX, a new framework for federated learning that addresses communication and personalization challenges.
result FLIX achieves dissimilarity regularization similar to local methods without requiring local steps.

EEG is the most common signal source for noninvasive BCI applications. For such applications, the EEG signal needs to be decoded and translated into appropriate actions. A recently emerging EEG decoding approach is deep learning with Convolutional or Recurrent Neural Networks (CNNs, RNNs) with many different architectu…

2018-06-18abs ↗pdf ↗

Bayesian approach to portfolio selection reduces pessimism in frequent trading.

problem Tackling the challenge of estimating drift in Merton's portfolio selection model.
method Bayesian distributionally robust control with nonlinear Wasserstein projections.
result Reduced pessimism and improved performance in frequent rebalancing compared to existing methods.

During the past decades, the Ising distribution has attracted interest in many applied disciplines, as the maximum entropy distribution associated to any set of correlated binary (`spin') variables with observed means and covariances. However, numerically speaking, the Ising distribution is unpractical, so alternative …

2018-03-07abs ↗pdf ↗

In the wake of the ongoing global financial crisis, interdependencies among banks have come into focus in trying to assess systemic risk. To date, such analysis has largely been based on numerical data. By contrast, this study attempts to gain further insight into bank interconnections by tapping into financial discuss…

2013-06-17abs ↗pdf ↗

This paper solves tensor robust principal component analysis via scaled gradient descent.

problem Extracting useful information from tensor data robust to corruptions and ill-conditioning.
method Directly recovers low-rank tensor factors via scaled gradient descent with adaptive thresholding.
result The proposed algorithm converges linearly to the true low-rank tensor at a constant rate independent of the condition number.

A new sparse benchmark metabench identifies key abilities from large benchmarks.

problem Redundancy and compression in existing benchmarks.
method Data from 5000+ LLMs to identify most informative items, distilling a sparse benchmark.
result Sparse benchmark metabench captures underlying abilities with high accuracy.

HiJoD detects misinformation using multiple aspects and outperforms state-of-the-art methods.

problem Detecting misinformation with limited labeled data.
method Hierarchical Joint Decomposition framework combining content, context, and domain features.
result HiJoD achieves F1-scores of 74% and 81% on Twitter and Politifact datasets respectively, and is faster than similar approaches.

Ensemble learning use multiple algorithms to obtain better predictive performance than any single one of its constituent algorithms could. With growing popularity of deep learning, researchers have started to ensemble them for various purposes. Few if any, however, has used the deep learning approach as a means to ense…

2019-05-30abs ↗pdf ↗

Paper introduces a new method for error estimation in classification tasks with limited data.

problem Challenges in designing accurate classifiers and evaluating their performance with limited training data.
method Introduces a novel Bayesian MMSE estimator for optimal Bayesian transfer learning (OBTL) using Monte Carlo importance sampling.
result Proposed OBTL error estimation scheme outperforms standard methods, especially in small-sample settings.

New link groups are derived from torus necklaces, connecting braid groups to reflection groups.

problem Understanding the relationship between braid groups and reflection groups.
method Constructing torus necklaces and linking them to braid groups of JJ-reflection groups.
result Link groups of torus necklaces are precisely braid groups of JJ-reflection groups, with meridians as braid reflections.

The study proves super-rigidity of Gromov's random monster group for various types of groups.

problem Super-rigidity of Gromov's random monster group in various group types.
method Proof of morphisms having finite image and introduction of hereditary super-rigidity.
result Gromov's random monster group has super-rigidity and hereditary super-rigidity with respect to certain groups.

We study the structure of the virtual braid group. It is shown that the virtual braid group is a semi--direct product of the virtual pure braid group and the symmetric group. Also, it is shown that the virtual pure braid group is a semi--direct product of free groups. From these results we obtain a normal form of words…

2004-07-23abs ↗pdf ↗

Virtual twin groups map to symmetric groups, revealing automorphism structure.

problem Understanding homomorphisms between virtual twin groups and symmetric groups.
method Using irreducible right-angled Coxeter groups and right-angled Artin groups.
result A complete description of homomorphisms between virtual twin groups and symmetric groups, including the structure of the automorphism group of VTnVT_n.