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

2579 · Feb 202019922001200920172026
48 results for attention-guided sorting

EAGLE-Net enhances foundation models by integrating patch-level features for better tissue understanding.

problem Foundation models lack mechanisms for global tissue structure and local context in computational pathology.
method EAGLE-Net combines multi-scale spatial encoding, attention-guided loss functions, and background suppression to aggregate patch-level features into slide-level predictions.
result EAGLE-Net improves classification accuracy and concordance indices across multiple cancer types, producing biologically coherent attention maps.

We propose an O(NM)O(N\cdot M) sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we discuss the application of this algorithm to sparse hash table.

2018-05-11abs ↗pdf ↗

Sorting an array is a fundamental routine in machine learning, one that is used to compute rank-based statistics, cumulative distribution functions (CDFs), quantiles, or to select closest neighbors and labels. The sorting function is however piece-wise constant (the sorting permutation of a vector does not change if th…

2019-05-28abs ↗pdf ↗

We propose a novel concept of a Systemic Optimal Risk Transfer Equilibrium (SORTE), which is inspired by the Bühlmann's classical notion of an Equilibrium Risk Exchange. We provide sufficient general assumptions that guarantee existence, uniqueness, and Pareto optimality of such a SORTE. In both the Bühlmann and the SO…

2019-07-09abs ↗pdf ↗

Framework improves marine mammal monitoring in noisy underwater environments.

problem Underwater bioacoustic monitoring challenges due to overlapping calls and variable noise.
method Multi-step attention-guided framework with segmentation and mid-level fusion.
result Improved signal discrimination, reduced false positives, reliable representations.

DSPO optimizes portfolio construction from raw stock data efficiently.

problem Manual design and misalignment in traditional portfolio construction methods.
method End-to-end neural network framework with Monotonical Logistic Regression loss.
result DSPO constructs optimal sorted portfolios with high performance metrics.

Sorting input objects is an important step in many machine learning pipelines. However, the sorting operator is non-differentiable with respect to its inputs, which prohibits end-to-end gradient-based optimization. In this work, we propose NeuralSort, a general-purpose continuous relaxation of the output of the sorting…

2019-03-21abs ↗pdf ↗

The paper sorts big data by revealed preferences, improving consumer and policy decisions.

problem Sorting diverse consumer preferences for big data objects like colleges.
method Endogenous weighting of revealed preferences, considering spillover effects.
result Consistent steady-state solution to counterbalance equilibrium.

Review and compare sorting model selection methods for preference disaggregation.

problem Selecting a representative sorting model from multiple compatible models.
method Reviewed and proposed new procedures for selecting sorting models, including robust assignment rule.
result Identified most efficient procedures in terms of classification accuracy and robustness.

The sorting operation is one of the most commonly used building blocks in computer programming. In machine learning, it is often used for robust statistics. However, seen as a function, it is piecewise linear and as a result includes many kinks where it is non-differentiable. More problematic is the related ranking ope…

2020-02-20abs ↗pdf ↗

Differentiable sorting and rank normalization are incompatible, with specific conditions for admissibility.

problem Incompatibility between differentiable sorting and rank normalization.
method Formalized admissibility through monotone invariance, batch independence, and rank-space stability conditions.
result Different gap-sensitive and batchwise relaxations of rank normalization violate the conditions for admissibility.

This paper addresses two seemingly unrelated problems, (a) What is the entropy and energy accounting in the Maxwell Demon problem? and (b) How can the efficiency of markets be measured? Here we show, in a simple model for the Maxwell Demon, the entropy of the universe increases by an amount eta=0.839995520 in going fro…

2003-11-15abs ↗pdf ↗

Several tasks in machine learning are evaluated using non-differentiable metrics such as mean average precision or Spearman correlation. However, their non-differentiability prevents from using them as objective functions in a learning framework. Surrogate and relaxation methods exist but tend to be specific to a given…

2019-04-08abs ↗pdf ↗

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…

2019-04-26abs ↗pdf ↗

SCQRNN prevents quantile crossing and improves computational efficiency.

problem Quantile crossing issue in regression models.
method Integrates ad hoc sorting in training to prevent quantile crossing and enhance computational efficiency.
result SCQRNN achieves faster convergence and non-intersecting quantiles.

New method estimates mixture model components efficiently.

problem Estimating the number of components in finite mixture models.
method Group-Sort-Fuse (GSF) procedure for simultaneous estimation of order and mixing measure.
result GSF achieves consistent estimation of true mixture order and n1/2n^{-1/2} convergence rate.

The paper examines the stability of Fama-French multi-factor models over time.

problem Stability of Fama-French multi-factor models over time.
method Rolling window method, Fama and MacBeth's two-step estimation, generalized GRS statistics.
result The effectiveness of Fama-French factors is not stable over time in all countries.

The purpose of this paper is to introduce a new growth adjusted price-earnings measure (GA-P/E) and assess its efficacy as measure of value and predictor of future stock returns. Taking inspiration from the interpretation of the traditional price-earnings ratio as a period of time, the new measure computes the requisit…

2020-01-22abs ↗pdf ↗

A new sorting method using R2R^2 values improves causal discovery from noisy data.

problem Improving causal discovery from noisy observational data.
method Introducing R2R^2-sortability and an algorithm, R2R^2-SortnRegress, to find causal order.
result Sorting variables by increasing R2R^2 yields a close-to-causal order.

Traditional set prediction models can struggle with simple datasets due to an issue we call the responsibility problem. We introduce a pooling method for sets of feature vectors based on sorting features across elements of the set. This can be used to construct a permutation-equivariant auto-encoder that avoids this re…

2019-06-06abs ↗pdf ↗

A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in: "Systemic optimal risk transfer equilibrium", Mathematics and Financial Economics (2021), for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets. A SORTE conjugates the classical Bühlmann's notion of a …

2019-12-27abs ↗pdf ↗

There has been a recent surge of interest in studying permutation-based models for ranking from pairwise comparison data. Despite being structurally richer and more robust than parametric ranking models, permutation-based models are less well understood statistically and generally lack efficient learning algorithms. In…

2017-10-28abs ↗pdf ↗

Let S be a surface of genus g with p punctures with negative Euler characteristic. We study the diameter of the εε-thick part of moduli space of S equipped with the Teichmüller or Thurston's Lipschitz metric. We show that the asymptotic behaviors in both metrics are of order logg+pε\log \frac{g+p}ε. The same result also ho…

2011-08-21abs ↗pdf ↗

We introduce the notion of skew-holomorphic Lie algebroid on a complex manifold, and explore some cohomologies theories that one can associate to it. Examples are given in terms of holomorphic Poisson structures of various sorts.

2010-03-09abs ↗pdf ↗