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

99197296394 · Jun 202019922001200920172026
48 results for majorization order

Novel analysis improves weighted majority vote in multiclass classification.

problem Improving the performance of weighted majority vote in multiclass classification.
method Analyzes expected risk of weighted majority vote, considering prediction correlations and provides a bound for efficient minimization.
result Minimization of the new bound typically does not degrade the test error of the ensemble.

The paper extends logistic regression for unbounded majority classes and derives asymptotic properties.

problem Infinitely imbalanced logistic regression inference.
method Derive a second order expansion for slope parameter under unbounded majority class.
result The second order term converges to a normal distribution with a variance depending only on the minority class's mean.

Study on price formation in a market with a major player and minor firms.

problem Equilibrium price formation in a market with a major financial firm and many minor firms.
method Analyzes the equilibrium price process in both finite and mean field models, considering idiosyncratic and common noises.
result Derives the functional form of price impact for the major firm in both market sizes.

QMME balances cost and speed in convex optimization.

problem Slow convergence of first-order methods and high cost of second-order methods.
method Minimizing quadratic majorants with fixed curvature at each iteration.
result QMME framework achieves sequential convergence under standard assumptions.

BMM algorithm improves convergence for nonconvex optimization problems.

problem Constrained nonsmooth nonconvex optimization problems.
method Block majorization-minimization with diminishing radius.
result Improved convergence rate for nonconvex optimization problems.

This paper examines autocorrelation in major crypto markets, finding persistent correlations on short time frames.

problem Assessing the efficiency of major cryptocurrency markets through autocorrelation analysis.
method Pearson's autocorrelation coefficient, Ljung-Box test, rolling window analysis.
result Persistent autocorrelation on 5m and 1H time frames, disagreement on 1D and 1W time frames.

Paper establishes sufficient condition for comparing linear combinations of infinite-mean risks.

problem Comparing linear combinations of infinite-mean risks under stochastic dominance.
method Introduced a new class of distributions and used majorization order to compare weights.
result Linear combinations of random variables are stochastically larger when their weight vectors are smaller in majorization order.

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.

Proposes BMME for optimizing nonsmooth nonconvex problems with block structure.

problem Optimizing nonsmooth nonconvex problems with block structure.
method Block Alternating Bregman Majorization Minimization with Extrapolation (BMME).
result Subsequential convergence to a first-order stationary point under mild assumptions, global convergence under stronger conditions.

In machine learning, Domain Adaptation (DA) arises when the distribution gen- erating the test (target) data differs from the one generating the learning (source) data. It is well known that DA is an hard task even under strong assumptions, among which the covariate-shift where the source and target distributions diver…

2012-12-11abs ↗pdf ↗

New PAC-Bayesian bounds for multi-view learning using Rényi divergence.

problem Applying PAC-Bayesian theory to multi-view learning.
method Introducing novel PAC-Bayesian bounds based on Rényi divergence for multi-view learning.
result Efficient optimization algorithms that align with theoretical bounds.

In order to emphasize cross-correlations for fluctuations in major market places, series of up and down spins are built from financial data. Patterns frequencies are measured, and statistical tests performed. Strong cross-correlations are emphasized, proving that market moves are collective behaviors.

2000-01-20abs ↗pdf ↗

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 ↗

The search of unconventional magnetic and nonmagnetic states is a major topic in the study of frustrated magnetism. Canonical examples of those states include various spin liquids and spin nematics. However, discerning their existence and the correct characterization is usually challenging. Here we introduce a machine-…

2018-04-23abs ↗pdf ↗

The significant computational requirements of deep learning present a major bottleneck for its large-scale adoption on hardware-constrained IoT-devices. Here, we envision a new paradigm called EdgeAI to address major impediments associated with deploying deep networks at the edge. Specifically, we discuss the existing …

2019-10-23abs ↗pdf ↗

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 ↗

The paper analyzes sports commentary to automatically recognize events and extract insights.

problem Automatically recognizing and categorizing major actions in sports events from commentary.
method Used multiple Natural Language Processing techniques for classification and sentiment analysis.
result Identified insights from analyzing live sport commentaries and classifying major actions.

Paper introduces a new identifiability criterion for DAGs using conditional variances.

problem Challenges in discovering causal relationships from observational data.
method Introduces a novel identifiability criterion for DAGs using conditional variances. Uses weak majorization on Cholesky factor of covariance matrix for learning DAGs.
result Demonstrates effectiveness of the new approach in recovering DAGs through simulations and real data analysis.

Paper introduces a new performance metric for class imbalance datasets.

problem Challenges in selecting and comparing models for imbalanced datasets.
method Proposes a new performance measure based on the harmonic mean of Recall and Selectivity normalized in class labels.
result The proposed measure is less sensitive to changes in the majority class and more sensitive to changes in the minority class.

The paper is mainly devoted to systematic developments and applications of geometric aspects of second-order variational analysis that are revolved around the concept of parabolic regularity of sets. This concept has been known in variational analysis for more than two decades while being largely underinvestigated. We …

2019-08-31abs ↗pdf ↗

This paper reviews zeroth-order optimization in signal processing and machine learning.

problem Optimization problems without gradient information.
method Iterative steps: gradient estimation, descent direction computation, solution update.
result Demonstrates applications in robustness evaluation and black-box model explanations.

This paper describes the design, implementation, and successful use of the Bristol Stock Exchange (BSE), a novel minimal simulation of a centralised financial market, based on a Limit Order Book (LOB) such as is common in major stock exchanges. Construction of BSE was motivated by the fact that most of the world's majo…

2018-09-17abs ↗pdf ↗

Factorization machine (FM) is an effective model for feature-based recommendation which utilizes inner product to capture second-order feature interactions. However, one of the major drawbacks of FM is that it couldn't capture complex high-order interaction signals. A common solution is to change the interaction functi…

2020-02-16abs ↗pdf ↗

The paper examines stochastic inequalities involving minimum and maximum claim amounts.

problem Investigating stochastic inequalities for claim amounts with random number of claims.
method Analyzing stochastic order and reversed hazard rate order for minimum and maximum claim amounts.
result Strengthening and generalizing existing results in the literature.

We study a robust Dynkin game over a set of mutually singular probabilities. We first prove that for the conservative player of the game, her lower and upper value processes coincide (i.e. She has a value process VV in the game). Such a result helps people connect the robust Dynkin game with second-order doubly refle…

2015-06-30abs ↗pdf ↗

Paper proposes AXE loss for non-autoregressive machine translation, improving performance.

problem Challenges in training non-autoregressive models due to lack of autoregressive factors and cross entropy loss penalties.
method Proposes aligned cross entropy (AXE) loss function using a differentiable dynamic program for better word order alignment.
result AXE-based training improves performance on major WMT benchmarks and sets a new state of the art for non-autoregressive models.

Variational calculus on a vector bundle E equipped with a structure of a general algebroid is developed, together with the corresponding analogs of Euler-Lagrange equations. Constrained systems are introduced in the variational and in the geometrical setting. The constrained Euler-Lagrange equations are derived for ana…

2007-12-17abs ↗pdf ↗

Inexact Riemannian optimization converges to stationary points efficiently.

problem Analyzing convergence and complexity of inexact Riemannian optimization.
method Tangential Block Majorization-Minimization (tBMM) framework.
result tBMM converges to an ε-stationary point within O(ε⁻²) iterations.

Paper introduces STSL, a second-order Tweedie sampler for efficient posterior sampling in inverse problems.

problem Computational challenges in sampling from posterior distributions using latent diffusion models.
method Introduces STSL, a novel second-order Tweedie sampler with tractable reverse process.
result STSL achieves 4X and 8X reduction in neural function evaluations compared to state-of-the-art solvers.