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

149298447596 · Jun 202019922001200920172026
48 results for computational perspective

We present a general probabilistic perspective on Gaussian filtering and smoothing. This allows us to show that common approaches to Gaussian filtering/smoothing can be distinguished solely by their methods of computing/approximating the means and covariances of joint probabilities. This implies that novel filters and …

2010-06-10abs ↗pdf ↗

Learning representations of data is an important problem in statistics and machine learning. While the origin of learning representations can be traced back to factor analysis and multidimensional scaling in statistics, it has become a central theme in deep learning with important applications in computer vision and co…

2019-11-26abs ↗pdf ↗

New perspective on federated learning as posterior inference, improving optimization.

problem Optimizing global models in distributed learning settings.
method Formulated as posterior inference problem, using MCMC for approximate inference and federated averaging for refinement.
result Federated posterior averaging (FedPA) outperforms existing methods on benchmarks.

Deep learning has sparked a network of mutual interactions between different disciplines and AI. Naturally, each discipline focuses and interprets the workings of deep learning in different ways. This diversity of perspectives on deep learning, from neuroscience to statistical physics, is a rich source of inspiration t…

2019-08-25abs ↗pdf ↗

Deep learning is increasingly being used in high-stake decision making applications that affect individual lives. However, deep learning models might exhibit algorithmic discrimination behaviors with respect to protected groups, potentially posing negative impacts on individuals and society. Therefore, fairness in deep…

2019-08-23abs ↗pdf ↗

In recent years, ideas from statistics and scientific computing have begun to interact in increasingly sophisticated and fruitful ways with ideas from computer science and the theory of algorithms to aid in the development of improved worst-case algorithms that are useful for large-scale scientific and Internet data an…

2010-10-08abs ↗pdf ↗

We explore the perspective of a bug living on the two-dimensional surface of a polyhedron. Images of various kinds of effects like lensing and cloaking are shown via color pictures of three viewpoints: the first person perspective of the bug, a map of the bug's viewpoint, and a look at the bug on the embedded polyhedro…

2017-06-19abs ↗pdf ↗

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning techniques to impressive results in regression, classification, data-generation and reinforcement learning tasks. Despite these successes, the proximity to the physical limits of chip fabrication al…

2017-07-26abs ↗pdf ↗

When undergraduates ask me what geometric group theorists study, I describe a theorem due to Gromov which relates the groups with an intrinsic geometry like that of the hyperbolic plane to those in which certain computations can be efficiently carried out. In short, I describe the close but surprising connection betwee…

2014-11-26abs ↗pdf ↗

Study trade-offs between statistical and computational efficiency in variational inference.

problem Optimizing statistical accuracy vs. computational efficiency in Bayesian inference.
method Case study on Gaussian inferential models with diagonal plus low-rank precision matrices, analyzing Bayesian posterior inference and frequentist uncertainty quantification errors.
result Lower-rank models reduce variance and accelerate convergence but increase posterior inference error.

We propose a new point of view for regularizing deep neural networks by using the norm of a reproducing kernel Hilbert space (RKHS). Even though this norm cannot be computed, it admits upper and lower approximations leading to various practical strategies. Specifically, this perspective (i) provides a common umbrella f…

2018-09-30abs ↗pdf ↗

How should statistical procedures be designed so as to be scalable computationally to the massive datasets that are increasingly the norm? When coupled with the requirement that an answer to an inferential question be delivered within a certain time budget, this question has significant repercussions for the field of s…

2013-09-30abs ↗pdf ↗

Machine learning combines high- and low-fidelity models for efficient uncertainty quantification and optimization.

problem Efficiently combining high- and low-fidelity models for uncertainty quantification and optimization.
method Machine learning-based multi-fidelity methods for uncertainty quantification and optimization.
result Unified perspective on multi-fidelity priors for optimization.

The paper analyzes diffusion condensation for data geometry and topology.

problem Understanding the geometry and topology of high-dimensional data.
method Time-inhomogeneous diffusion process with geometric, spectral, and topological analysis.
result The condensation process defines intrinsic condensation homology and ambient persistent homology.

A new XVA strategy rooted in balance sheet perspective improves equity process for bank shareholders.

problem Counterparty risk valuation adjustments (XVAs) in financial derivatives.
method Develops a cost-of-capital XVA strategy in a balance sheet perspective, solving explicitly in static setup and dynamically in trade context.
result Ensures a submartingale equity process corresponding to a target hurdle rate on capital at risk.

In this note, we point out a basic link between generative adversarial (GA) training and binary classification -- any powerful discriminator essentially computes an (f-)divergence between real and generated samples. The result, repeatedly re-derived in decision theory, has implications for GA Networks (GANs), providing…

2017-09-05abs ↗pdf ↗

Convolutional networks outperform fully-connected ones in certain tasks.

problem Understanding the computational advantage of convolutional networks over fully-connected networks.
method Demonstrated a computational advantage through a specific problem class.
result Convolutional networks can solve certain problems that fully-connected networks cannot, even with gradient descent.

Survey on computational models in dynamical systems, including new universality concepts.

problem Understanding the relationship between computational models and dynamical systems.
method Review of recent works on Turing universality, Topological Kleene Field Theories, and dynamical bordisms.
result Introduction of new perspectives on computability through dynamical systems.

New evidence shows computational barriers in graphon estimation using low-degree polynomials.

problem Estimating graphons efficiently and accurately.
method Low-degree polynomials to analyze computational limits.
result Low-degree polynomial estimators cannot significantly outperform USVT in graphon estimation.

Mobile big data contains vast statistical features in various dimensions, including spatial, temporal, and the underlying social domain. Understanding and exploiting the features of mobile data from a social network perspective will be extremely beneficial to wireless networks, from planning, operation, and maintenance…

2016-09-30abs ↗pdf ↗

To study users' travel behaviour and travel time between origin and destination, researchers employ travel surveys. Although there is consensus in the field about the potential, after over ten years of research and field experimentation, Smartphone-based travel surveys still did not take off to a large scale. Here, com…

2019-12-24abs ↗pdf ↗

A new CoVaR framework integrates expert views using entropy pooling.

problem Risk assessment and spillover effects from diverse expert views.
method Entropy pooling method to integrate expert views and compute general CoVaR.
result General CoVaR shows linear relationships with expectations and differences in expectations, and nonlinear dependencies with variance, quantiles, and correlation.

One popular method for dealing with large-scale data sets is sampling. For example, by using the empirical statistical leverage scores as an importance sampling distribution, the method of algorithmic leveraging samples and rescales rows/columns of data matrices to reduce the data size before performing computations on…

2013-06-23abs ↗pdf ↗

It is well-known that neural networks are computationally hard to train. On the other hand, in practice, modern day neural networks are trained efficiently using SGD and a variety of tricks that include different activation functions (e.g. ReLU), over-specification (i.e., train networks which are larger than needed), a…

2014-10-05abs ↗pdf ↗

This paper surveys enterprise financial risk analysis from Big Data and LLMs perspectives.

problem Predicting future financial risk of enterprises.
method Systematic literature review of enterprise financial risk analysis approaches from Big Data and LLMs perspectives.
result Offers a holistic synthesis of research methods and key insights.

Bayesian deep learning counts crowds robustly despite occlusions and scale variations.

problem Accurately counting individuals in crowded scenes with occlusions and varying sizes.
method Proposes a Bayesian multi-scale neural network with a ResNet feature extractor, dilated convolutions, and a Perspective-aware Aggregation Module.
result Achieves superior performance on crowd counting benchmarks with uncertainty estimates.

Normalizing flows provide a general mechanism for defining expressive probability distributions, only requiring the specification of a (usually simple) base distribution and a series of bijective transformations. There has been much recent work on normalizing flows, ranging from improving their expressive power to expa…

2019-12-05abs ↗pdf ↗

In GT/0006019 oriented quantum algebras were motivated and introduced in a natural categorical setting. Invariants of knots and links can be computed from oriented quantum algebras, and this includes the Reshetikhin-Turaev theory for Ribbon Hopf algebras. Here we continue the study of oriented quantum algebras from a m…

2000-06-03abs ↗pdf ↗

Machine learning models predict which ideas will be innovated based on subjective perspectives.

problem Predicting high-impact innovation based on subjective perspectives and interpersonal innovation opportunities.
method Quantifying subjective perspectives and their interaction based on innovator positions within a geometric space of concepts.
result Subjective perspectives predict which ideas individuals and groups will creatively attend to and successfully combine in the future.