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

35810 · Mar 202619922001200920172026
48 results for necessity

Paper proposes forecast-necessity testing for accurate causal interpretation in nonlinear time-series models.

problem Misinterpretation of causal scores from nonlinear models as regression coefficients.
method Systematic edge ablation and forecast comparison to evaluate causal necessity.
result Causal relationships with similar scores can differ in their necessity for accurate prediction.

Unified feature importance for machine learning models tackles sufficiency and necessity limitations.

problem Insufficient and incomplete explanations of machine learning models.
method Formalized sufficiency and necessity notions, proposing a unified importance measure.
result Unified importance measure detects features missed by sufficiency and necessity alone.

AdaDKRR tackles data silos by combining autonomy, privacy, and collaboration.

problem Data silos caused by privacy and interoperability constraints.
method Adaptive distributed kernel ridge regression (AdaDKRR) with autonomy, privacy, and collaboration.
result AdaDKRR performs similarly to optimal learning algorithms on the whole data under mild conditions.

Optimal machine learning requires interpolating training data in high-dimensional linear regression.

problem Achieving optimal predictive risk in overparameterized linear regression models.
method Analyzing proportional asymptotics of random design and label noise variance.
result Optimal performance in linear regression requires fitting training data to higher accuracy than inherent noise.

We prove that every Kaehler solvmanifold has a finite covering whose holomorphic reduction is a principal bundle. An example is given that illustrates the necessity, in general, of passing to a proper covering. We also answer a stronger version of a question posed by Akhiezer for homogeneous spaces of nonsolvable algeb…

2007-01-31abs ↗pdf ↗

The paper addresses bias amplification in prediction and decision-making using causal analysis.

problem Bias amplification in automated systems, especially after thresholding.
method Introduces margin complement and causal decomposition of prediction disparities.
result Disparity in predictor Y^\widehat Y can be decomposed into causal influences of XX on SS and MM.

In this work we wish characterize the Einstein manifolds (M,g)(M,g), however without the necessity of hypothesis of compactness over MM and unitary volume of gg, which are well known in many works. Our result says that if all eingenvalues λλ of rgr_{g}, with respect to gg, satisfy λ1nsgλ\geq \frac{1}{n}s_{g}, then $(M,g)…

2009-12-17abs ↗pdf ↗

Paper establishes a general inequality for warped product CR-submanifolds in Kähler manifolds.

problem Finding a general inequality for warped product contact CR-submanifolds in Kähler manifolds.
method Using the Gauss equation, the paper establishes a general inequality for warped product contact CR-submanifolds in Sasakian and Kenmotsu manifolds.
result The paper proves an optimal general inequality for warped product contact CR-submanifolds in both Sasakian and Kenmotsu manifolds.

This is a survey on quaternion Hermitian Weyl (locally conformally quaternion Kähler) and hyperhermitian Weyl (locally conformally hyperkähler) manifolds. These geometries appear by requesting the compatibility of some quaternion Hermitian or hyperhermitian structure with a Weyl structure. The motivation for such a stu…

2001-05-05abs ↗pdf ↗

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a dd-dimensional compact submanifold MM in RD\mathbb{R}^D, we establish the spectral convergence rate…

2015-10-27abs ↗pdf ↗

This study evaluates the importance of design of experiments for PINN in physics-informed deep learning.

problem Accuracy of PINN predictions depends on the design of experiment scheme.
method Comparative study of five PDEs using different design of experiment schemes.
result Hammersley sampling-based PINN outperforms other design of experiment schemes.

We discuss Russia's underlying motives for issuing its government-backed cryptocurrency, CryptoRuble, and the implications thereof and of other likely-soon-forthcoming government-issued cryptocurrencies to some stakeholders (populace, governments, economy, finance, etc.), existing decentralized cryptocurrencies (such a…

2018-01-17abs ↗pdf ↗

New framework for fairness in continuous protected attributes.

problem Inherited biases in AI predictions with continuous protected attributes.
method Formalizes SP and PP through path-specific partial derivatives, introduces a fair tuning algorithm.
result Existence and construction of fair predictors that satisfy SP along not-allowed paths and PP along allowed paths.

The study proves nearly Frobenius algebras over certain domains are Frobenius.

problem Understanding nearly Frobenius algebras and their properties.
method Analyzing nearly Frobenius algebras over principal ideal domains with specific algebraic properties.
result Any nearly Frobenius algebra with surjective multiplication and injective comultiplication is a Frobenius algebra.

Value-function approximation methods that operate in batch mode have foundational importance to reinforcement learning (RL). Finite sample guarantees for these methods often crucially rely on two types of assumptions: (1) mild distribution shift, and (2) representation conditions that are stronger than realizability. H…

2019-05-01abs ↗pdf ↗

This paper is intended to explain, in simple terms, some of the mechanisms and agents common to multiagent financial market simulations. We first discuss the necessity to include an exogenous price time series ("the fundamental value") for each asset and three methods for generating that series. We then illustrate one …

2019-09-25abs ↗pdf ↗

We provide the first information theoretic tight analysis for inference of latent community structure given a sparse graph along with high dimensional node covariates, correlated with the same latent communities. Our work bridges recent theoretical breakthroughs in the detection of latent community structure without no…

2018-07-23abs ↗pdf ↗

We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of interm…

2016-12-16abs ↗pdf ↗

Rogue is a famous dungeon-crawling video-game of the 80ies, the ancestor of its gender. Rogue-like games are known for the necessity to explore partially observable and always different randomly-generated labyrinths, preventing any form of level replay. As such, they serve as a very natural and challenging task for rei…

2018-04-23abs ↗pdf ↗

In real supervised learning scenarios, it is not uncommon that the training and test sample follow different probability distributions, thus rendering the necessity to correct the sampling bias. Focusing on a particular covariate shift problem, we derive high probability confidence bounds for the kernel mean matching (…

2012-06-18abs ↗pdf ↗

Deep learning models generalize by extending decision boundaries outside the convex hull of training data.

problem Understanding how deep learning models generalize beyond their training data.
method Investigation of decision boundaries inside and outside the convex hull of training sets, using various neural network architectures and training regimes.
result Over-parameterization is necessary for deep learning models to extend decision boundaries outside the convex hull of their training data.

The increasing use of machine learning in practice and legal regulations like EU's GDPR cause the necessity to be able to explain the prediction and behavior of machine learning models. A prominent example of particularly intuitive explanations of AI models in the context of decision making are counterfactual explanati…

2019-08-02abs ↗pdf ↗

The banking systems that deal with risk management depend on underlying risk measures. Following the Basel II accord, there are two separate methods by which banks may determine their capital requirement. The Value at Risk measure plays an important role in computing the capital for both approaches. In this paper we an…

2011-11-18abs ↗pdf ↗

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index 5\ge 5. In order to have the necessity part, graphs are organized into small classes so that one of homological or cohomological characteristics of right-angled Artin groups can be applied. Fi…

2008-05-01abs ↗pdf ↗

New method uses momentum to converge in DC optimization with small batches.

problem Lack of convergence properties for stochastic difference-of-convex optimization with small batch sizes.
method Introduces momentum to enable convergence under standard assumptions for any batch size.
result Proves convergence of the algorithm under smoothness and bounded variance assumptions.

Due to recent advances - compute, data, models - the role of learning in autonomous systems has expanded significantly, rendering new applications possible for the first time. While some of the most significant benefits are obtained in the perception modules of the software stack, other aspects continue to rely on know…

2018-06-15abs ↗pdf ↗

The complement of a non-separating planar graph contains a K_n minor.

problem Characterizing the structure of complements of planar graphs.
method Analyzing the structure of complements of non-separating planar graphs and using examples to illustrate hypotheses.
result The order 2n-3 is the lowest possible for a non-separating planar graph whose complement contains a K_n minor.

Paper explores second-order optimization in first-order methods, proving and disproving the necessity of square root.

problem Understanding and optimizing first-order optimization methods using second-order information.
method Rigorously proves Nesterov Accelerated Gradient uses past and current gradients to approximate Hessian. Relates adaptive methods to Natural Gradient Descent. Introduces AdaSqrt algorithm to remove square root in denominator.
result New algorithm AdaSqrt comparable to first-order methods on MNIST and beats Adam on CIFAR-10, casting doubt on the necessity of square root.

The paper extends fairness to hierarchical clustering, finding efficient algorithms with minimal loss.

problem Ensuring fairness in hierarchical clustering where data is recursively partitioned.
method Extending fairness to hierarchical clustering, developing simple, efficient algorithms for various objectives.
result Simple, efficient algorithms for fair hierarchical clustering with only a negligible loss in objective.