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

50101151201 · Jun 202019922001200920172026
48 results for Determinant Majorization

Estimates for polynomial operators using determinant majorization and subharmonics.

problem Bounding solutions of polynomial operators on Euclidean domains.
method Combines Alexandrov estimate and determinant majorization, using subharmonics and semiconvex approximation.
result Includes classical Alexandrov-Bakelman-Pucci estimate for linear operators.

Formula establishes determinant majorization for symmetric matrices.

problem Determining determinant majorization for symmetric matrices.
method Establishes determinant majorization formula for symmetric matrices using invariant Garding-Dirichlet polynomials.
result Formula F(A)1Ndet(A)1nF(A)^{1\over N} \geq \det(A)^{1\over n} for symmetric matrices.

We introduce a norm on the real 1-cohomology of finite 2-complexes determined by the Euler characteristics of graphs on these complexes. We also introduce twisted Alexander-Fox polynomials of groups and show that they give rise to norms on the real 1-cohomology of groups. Our main theorem states that for a finite 2-com…

2002-03-05abs ↗pdf ↗

In this work, we analyze the problem of adoption of mobile money in Pakistan by using the call detail records of a major telecom company as our input. Our results highlight the fact that different sections of the society have different patterns of adoption of digital financial services but user mobility related feature…

2017-11-13abs ↗pdf ↗

A major bottleneck for developing general reinforcement learning agents is determining rewards that will yield desirable behaviors under various circumstances. We introduce a general mechanism for automatically specifying meaningful behaviors from raw pixels. In particular, we train a generative adversarial network to …

2017-11-21abs ↗pdf ↗

Specialists outperform generalists in ensemble classification.

problem Determining the accuracy of an ensemble of classifiers when individual classifier accuracies are known.
method Proved upper and lower bounds on ensemble accuracy, constructed specialist and generalist classifiers.
result Upper and lower bounds on ensemble accuracy, practical implications for classifier construction.

We say that a link L1L_1 is an s-major of a link L2L_2 if any diagram of L1L_1 can be transformed into a diagram of L2L_2 by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knot…

2008-06-22abs ↗pdf ↗

Unified framework for certifying LLM reliability without extra supervision.

problem Improving reliability of large language models without additional supervision.
method Unified framework using majority voting and Martingale Majority Certificate (MMC).
result Certifiable inference in LLMs with statistical guarantees and adaptive stopping rules.

We study the relationship between many natural conditions that one can put on a diffeological vector space: being fine or projective, having enough smooth (or smooth linear) functionals to separate points, having a diffeology determined by the smooth linear functionals, having fine finite-dimensional subspaces, and hav…

2017-03-22abs ↗pdf ↗

Accurately determining dependency structure is critical to discovering a system's causal organization. We recently showed that the transfer entropy fails in a key aspect of this---measuring information flow---due to its conflation of dyadic and polyadic relationships. We extend this observation to demonstrate that this…

2016-09-05abs ↗pdf ↗

In this short paper we define the wealth process in a spin model for market microstructure, for individual agents and in aggregate. The agents in our model try to balance their desire to belong to the local majority (herding behavior), defined over random network neighborhoods, and the occasional advantage of belonging…

2005-02-07abs ↗pdf ↗

The paper shows the computation of the noncommutative generalization of the A-polynomial of the trefoil knot. The classical A-polynomial was introduced by Cooper, Culler, Gillet, Long and Shalen, and was generalized to the context of Kauffman bracket skein modules by the author in joint work with Frohman and Lofaro. A …

2000-04-25abs ↗pdf ↗

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a polynomial-length certificate that can be verified in polynomial time to prove that K…

2011-12-05abs ↗pdf ↗

We use the criteria of Lalonde and McDuff to determine a new class of examples of length minimizing paths in the group Ham(M)Ham(M). For a compact symplectic manifold MM of dimension two or four, we show that a path in Ham(M)Ham(M), generated by an autonomous Hamiltonian and starting at the identity, which induces no non-cons…

1999-05-18abs ↗pdf ↗

The paper tackles sampling biases by ensuring minority groups are adequately represented in training data.

problem Sampling biases in training data lead to algorithmic biases in machine learning systems.
method The paper presents adaptive sampling methods to determine if it's possible to assemble a representative dataset from given data sources.
result The methods presented can determine with high confidence if a representative dataset can be assembled from given data sources.

One of the central themes in the classification task is the estimation of class posterior probability at a new point x\bf{x}. The vast majority of classifiers output a score for x\bf{x}, which is monotonically related to the posterior probability via an unknown relationship. There are many attempts in the literature …

2019-09-12abs ↗pdf ↗

Optimized sampling scheme for compressed sensing combining randomness and determinism.

problem Improving compressed sensing performance with deterministic sampling.
method Optimized sampling scheme combining random and deterministic selection of rows.
result Measurable improvements in image compressed sensing for generative and sparse priors.

Develops a learning model predictive controller for competitive racing.

problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.

The paper develops a decision support system for hierarchical text classification of conference proceedings.

problem Classifying documents with a fixed hierarchical structure of topics.
method Developed a weighted hierarchical similarity function to calculate topic relevance, using entropy of words to estimate weights.
result The weighted hierarchical similarity function improves ranking accuracy compared to other methods.

A new method preserves useful information in data rows with outlying cells.

problem Preserving useful information in data rows with outlying cells.
method Cellwise robust Minimum Covariance Determinant (cellMCD) method using observed likelihood and a penalty term on cellwise outliers.
result The cellMCD method performs well in simulations and on real data.

Paper proposes optimal investment and reinsurance strategies considering financial and insurance risks dependence.

problem Optimal investment and reinsurance strategies under dependent financial and insurance risks.
method Stochastic control approach to maximize expected exponential utility of terminal wealth.
result Minimal dependence between financial and insurance risks significantly impacts investment and reinsurance strategies.

This work analyzes the Gompertz-Pareto distribution (GPD) of personal income, formed by the combination of the Gompertz curve, representing the overwhelming majority of the economically less favorable part of the population of a country, and the Pareto power law, which describes its tiny richest part. Equations for the…

2010-10-11abs ↗pdf ↗

This paper reports empirical evidence that a neural networks model is applicable to the statistically reliable prediction of foreign exchange rates. Time series data and technical indicators such as moving average, are fed to neural nets to capture the underlying "rules" of the movement in currency exchange rates. The …

2003-04-21abs ↗pdf ↗

Best-of-Majority improves inference performance in Pass@kk settings.

problem Inference in difficult tasks often underperforms with single-shot selection methods.
method Combining majority voting and Best-of-N, Best-of-Majority restricts candidates to high-frequency responses.
result Best-of-Majority achieves minimax optimal regret and outperforms other methods.

Modeling financial contagion through bank networks, revealing solvency correlations.

problem Understanding how financial shocks propagate through interconnected banks.
method Simulated financial network of 100 banks, randomly generated with varying link probabilities, and shocks applied to 15 banks.
result Ranges of probability values and banks' solvency are positively correlated.

Nowadays, the major challenge in machine learning is the Big Data challenge. The big data problems due to large number of data points or large number of features in each data point, or both, the training of models have become very slow. The training time has two major components: Time to access the data and time to pro…

2018-01-18abs ↗pdf ↗