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

68136204272 · Jun 202019922001200920172026
48 results for CATCH objective

New method optimizes hierarchical multi-label classification results.

problem Optimizing classification results respecting class hierarchy and classifier scores.
method Introducing CATCH objective function and mLPR metric to rank multi-label classification results.
result HierRank algorithm optimizes CATCH, improving decision accuracy.

New algorithms detect outliers in high-dimensional data with arbitrary shapes.

problem Challenges of high dimensionality and varying cluster shapes in traditional outlier detection methods.
method Cluster Catch Digraphs (CCDs) and their variants (U-MCCD, UN-MCCD, SU-MCCD, SUN-MCCD).
result U-MCCD efficiently identifies outliers with high true negative rates, and SU-MCCD improves handling of non-uniform clusters.

A drone catches another agile drone using competitive reinforcement learning.

problem Intercepting an agile drone with another agile drone.
method Formulated as a Competitive Reinforcement Learning problem, trained with PPO, using a high-fidelity simulation environment.
result Trained policies outperform common heuristic baselines in catch rate, time to catch, and crash rate.

Two new outlyingness scores improve outlier detection in high-dimensional data.

problem Detecting outliers in high-dimensional data with varying cluster shapes and intensities.
method Outlyingness scores (OOS and IOS) based on Cluster Catch Digraphs (CCDs).
result Both OOS and IOS outperform CCD-based methods in identifying global and local outliers, especially IOS.

New framework optimizes deep learning training by deferring large batch sizes to late stages.

problem Optimizing batch size scheduling for deep learning training efficiency.
method Introduced the functional scaling law (FSL) framework to analyze and optimize batch size scheduling.
result Large batch sizes can be deferred to late training stages without sacrificing performance.

We study the market selection hypothesis in complete financial markets, populated by heterogeneous agents. We allow for a rich structure of heterogeneity: individuals may differ in their beliefs concerning the economy, information and learning mechanism, risk aversion, impatience and 'catching up with Joneses' preferen…

2011-06-15abs ↗pdf ↗

A new graph-based clustering method for moderate-dimensional data.

problem Performance degradation of existing graph-based clustering methods in high dimensions.
method Introduces UN-CCDs using NND-based MC-SRT for covering radii determination.
result UN-CCDs provide stable and competitive performance in moderate-sized datasets.

The issue of giving an explicit description of the flow of information concerning the time of bankruptcy of a company (or a state) arriving on the market is tackled by defining a bridge process starting from zero and conditioned to be equal to zero when the default occurs. This enables to catch some empirical facts on …

2016-01-08abs ↗pdf ↗

Robot-assisted dressing offers an opportunity to benefit the lives of many people with disabilities, such as some older adults. However, robots currently lack common sense about the physical implications of their actions on people. The physical implications of dressing are complicated by non-rigid garments, which can r…

2017-09-27abs ↗pdf ↗

Parameter-free clustering method using cluster catch digraphs (CCDs).

problem Finding the correct number of clusters in data without specifying a parameter.
method Hybrid of density-based and graph-based clustering methods using Ripley's K function.
result Minimum dominating sets of RK-CCDs estimate and distinguish clusters from noise.

We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digraphs (PCDs). A related geometric digraph family, class cover catch digraph (CCCD), has been used to solve the class cover problem by using its…

2017-05-22abs ↗pdf ↗

Efficient exploration is necessary to achieve good sample efficiency for reinforcement learning in general. From small, tabular settings such as gridworlds to large, continuous and sparse reward settings such as robotic object manipulation tasks, exploration through adding an uncertainty bonus to the reward function ha…

2019-06-18abs ↗pdf ↗

In dynamic environments, learned controllers are supposed to take motion into account when selecting the action to be taken. However, in existing reinforcement learning works motion is rarely treated explicitly; it is rather assumed that the controller learns the necessary motion representation from temporal stacks of …

2019-01-10abs ↗pdf ↗

We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of sequences may be singled out almost surely with respect to certain probability …

2009-01-15abs ↗pdf ↗

The aim of this paper is to introduce a risk measure that extends the Gini-type measures of risk and variability, the Extended Gini Shortfall, by taking risk aversion into consideration. Our risk measure is coherent and catches variability, an important concept for risk management. The analysis is made under the Choque…

2017-07-23abs ↗pdf ↗

In this paper a new dissimilarity measure to identify groups of assets dynamics is proposed. The underlying generating process is assumed to be a diffusion process solution of stochastic differential equations and observed at discrete time. The mesh of observations is not required to shrink to zero. As distance between…

2008-09-23abs ↗pdf ↗

A novel framework interprets driving patterns using Action phases clustering.

problem Challenges in comprehending driving heterogeneity from underlying behavior mechanisms.
method Resampling and Downsampling Method (RDM) followed by iterative clustering calibration.
result Six driving patterns identified in real-world datasets, revealing dynamic nature of driving.

In this article, we prove that on any compact spin manifold of dimension m congruent 0,6,7 mod 8, there exists a metric, for which the associated Dirac operator has at least one eigenvalue of multiplicity at least two. We prove this by catching the desired metric in a subspace of Riemannian metrics with a loop that is …

2015-04-04abs ↗pdf ↗

Detect facial keypoints is a critical element in face recognition. However, there is difficulty to catch keypoints on the face due to complex influences from original images, and there is no guidance to suitable algorithms. In this paper, we study different algorithms that can be applied to locate keyponits. Specifical…

2017-10-15abs ↗pdf ↗

In order to reduce signalling, traders may resort to limiting access to dark venues and imposing limits on minimum fill sizes they are willing to trade. However, doing this also restricts the liquidity available to the trader since an ever increasing quantity of orders are traded by algos in clips. An alternative is to…

2017-10-17abs ↗pdf ↗

Despite the fact that generative models are extremely successful in practice, the theory underlying this phenomenon is only starting to catch up with practice. In this work we address the question of the universality of generative models: is it true that neural networks can approximate any data manifold arbitrarily wel…

2019-05-27abs ↗pdf ↗

As advances in signature recognition have reached a new plateau of performance at around 2% error rate, it is interesting to investigate alternative approaches. The approach detailed in this paper looks at using Variational Auto-Encoders (VAEs) to learn a latent space representation of genuine signatures. This is then …

2019-04-18abs ↗pdf ↗

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

In the aftermath of the 2007 global financial crisis, banks started reflecting into derivative pricing the cost of capital and collateral funding through XVA metrics. Here XVA is a catch-all acronym whereby X is replaced by a letter such as C for credit, D for debt, F for funding, K for capital and so on, and VA stands…

2016-03-09abs ↗pdf ↗

Tuna-AI uses ML to predict tuna biomass from oceanography and echo-sounder data.

problem Estimating tuna biomass from limited data sources.
method Developed a Machine Learning model using 3-day echo-sounder data and oceanographic data.
result Tuna-AI predicts tuna biomass with high accuracy using a 3-day window of data.

AdaX improves Adam by exponentially accumulating past gradients, leading to better performance in machine learning tasks.

problem Adam's fast convergence can lead to local minimums in non-convex problems.
method AdaX exponentially accumulates past gradients to adaptively tune the learning rate.
result AdaX outperforms Adam in various machine learning tasks, including computer vision and natural language processing.

In this paper, we develop a theory of market crashes resulting from a deleveraging shock. We consider two representative investors in a market holding different opinions about the public available information. The deleveraging shock forces the high confidence investors to liquidate their risky assets to pay back their …

2015-11-12abs ↗pdf ↗

The paper critiques UBI as ineffective for addressing technological unemployment.

problem Technological unemployment due to automation.
method Empirical data analysis and theoretical projections of UBI's impact.
result UBI is not an effective solution for improving living standards and employability among displaced workers.

The paper identifies clusters in the World Trade Network using communicability distances.

problem Identifying clusters in the World Trade Network.
method Uses Estrada and vibrational communicability distances to find clusters maximizing a modularity function.
result Identifies specific distance thresholds that maximize modularity, revealing unique relationships between countries.

This research smooths out fluid equations to avoid sudden shocks.

problem Formation of shock singularities in compressible fluid equations.
method Information geometric regularization of unidimensional pressureless Euler equations.
result Smooth global solutions without artificial viscosity.

Improves relevancy of black-box anomaly detectors with user feedback.

problem Users often ignore many detected anomalies, requiring a method to identify and prioritize relevant ones.
method Uses user feedback to adjust anomaly selection process based on identified anomaly types.
result Significant improvements in precision and recall over various anomaly detectors.

Many neural network architectures rely on the choice of the activation function for each hidden layer. Given the activation function, the neural network is trained over the bias and the weight parameters. The bias catches the center of the activation, and the weights capture the scale. Here we propose to train the netw…

2019-01-28abs ↗pdf ↗

We designed a grid world task to study human planning and re-planning behavior in an unknown stochastic environment. In our grid world, participants were asked to travel from a random starting point to a random goal position while maximizing their reward. Because they were not familiar with the environment, they needed…

2017-09-27abs ↗pdf ↗