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

9182736 · Jun 202019922001200920172026
48 results for Asymmetric collaboration

In this paper we show how the study of asymmetric R&D alliances, that are those between young and small firms and large and MNEs firms for knowledge exploration and/or exploitation, requires the adoption of a coopetitive framework which consider both collaboration and competition. We draw upon the literature on asymmet…

2012-05-13abs ↗pdf ↗

A new privacy-preserving deep learning scheme for asymmetrically collaborative machine learning.

problem Privacy and efficiency in collaborative machine learning across different data owners.
method Decomposes neural network steps for privacy-preserving training; novel protocol for information leakage.
result Efficient training with stable performance and significant speedup.

Study of geometric analysis on asymmetric metric spaces, including heat flow and Sobolev spaces.

problem Analysis of geometric properties on asymmetric metric measure spaces.
method Introduction of upper gradients, qq-Laplacian, and qq-heat flow in asymmetric settings.
result Extension of concepts from symmetric to asymmetric metric measure spaces.

This study examines asymmetric cross-correlations in cryptocurrency markets using fractal analysis.

problem Exploring asymmetric multifractal cross-correlations in cryptocurrency markets.
method Fractal analysis and MF-ADCCA method to investigate asymmetric volatility dynamics.
result Cross-correlations are stronger in downtrend markets than in uptrend markets for maturing BTC and ETH.

Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.

problem Lack of precise theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
method Adapting a finite-time convergence analysis to the asymmetric actor-critic setting with linear function approximators.
result A finite-time bound reveals that the asymmetric critic eliminates aliasing errors in the agent state.

We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context. Shrivastava and Li argue that there is no symmetric LSH for the problem and propose an asymmetric LSH based on different mappings for query and database points. Howev…

2014-10-21abs ↗pdf ↗

The paper improves asymmetric causality tests by addressing inefficiencies and statistical significance issues.

problem Inefficiencies and statistical significance issues in asymmetric causality tests.
method Improved asymmetric causality tests via partial cumulative sums for positive and negative components, explicitly testing differences between causal parameters.
result Efficiently tested hypotheses on asymmetric causal interaction between financial markets.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗

Bayesian VI copula models capture asymmetric intraday equity dependence.

problem Modeling asymmetric and extreme tail dependence in financial data.
method Bayesian variational inference for skew-t copula models in high dimensions.
result The copula captures substantial heterogeneity in asymmetric dependence over equity pairs and time.

Supply Chain Management often requires independent organizations to work together to achieve shared objectives. This collaboration is necessary when coordinated actions benefit the group more than the uncoordinated efforts of individual firms. Despite the commonly reported benefits that can be gained in close relations…

2016-10-10abs ↗pdf ↗

Extends multidimensional scaling to analyze three-way asymmetric proximities.

problem Analyzing asymmetric and three-way proximities in a Euclidean space.
method Unified h-plot methodology for three-way asymmetric proximities, including symmetric and conditional frameworks.
result Identification of archetypal profiles and clustering structures.

In recent years, correntropy has been seccessfully applied to robust adaptive filtering to eliminate adverse effects of impulsive noises or outliers. Correntropy is generally defined as the expectation of a Gaussian kernel between two random variables. This definition is reasonable when the error between the two random…

2019-11-21abs ↗pdf ↗

This paper introduces constrained mixtures for continuous distributions, characterized by a mixture of distributions where each distribution has a shape similar to the base distribution and disjoint domains. This new concept is used to create generalized asymmetric versions of the Laplace and normal distributions, whic…

2015-03-22abs ↗pdf ↗

Enhances reinforcement learning with partial state information.

problem Improving learning under partial observability with limited privileged signals.
method Introduced informed asymmetric actor-critic framework that uses arbitrary state-dependent privileged signals.
result Unbiased policy gradient estimates with arbitrary privileged signals.

The excellent performance of representation learning of autoencoders have attracted considerable interest in various applications. However, the structure and multi-local collaborative relationships of unlabeled data are ignored in their encoding procedure that limits the capability of feature extraction. This paper pre…

2019-06-12abs ↗pdf ↗

Paper defines saddle points in asymmetric Dynkin games using martingale theory.

problem Tackles saddle point conditions in asymmetric Dynkin games with partial information.
method Uses martingale theory to identify super and submartingales related to equilibrium payoffs.
result Characterizes saddle point strategies in terms of equilibrium payoffs' dynamics and Doob-Meyer decompositions.

Study uncovers new phase transitions in asymmetric causal inference scenarios.

problem Understanding typical phase transitions in asymmetric causal inference.
method Combining Causal inference (C-inf) and Low-rank recovery (LRR) with Random duality - Free probability theory (RDT-FPT).
result Discovering a doubling low-rankness phenomenon in asymmetric scenarios.

Modified asymmetric hidden Markov models for time series with autoregressive components.

problem Dynamic relationships between variables in time series data.
method Introducing an asymmetric autoregressive component to recent asymmetric hidden Markov models.
result The model can choose the optimal autoregressive order for better likelihood.

Study proves value of non-Markovian games with partial, asymmetric info.

problem Value of non-Markovian Dynkin games with partial and asymmetric information.
method Probabilistic and functional analytic approach based on Sion's min-max theorem.
result Existence of optimal strategies for both players in randomised stopping times.

Innovative extensions to option pricing models using asymmetric Brownian motion and random walk approaches.

problem Capturing empirical phenomena like return skewness, heavy tails, and volatility asymmetry in option pricing models.
method Developing the Geometric Asymmetric Brownian Motion (GABM) within the Bachelier--Black--Scholes--Merton framework.
result Deriving closed-form option pricing formulas and a discrete-time binomial tree algorithm that converges to the GABM limit.

Online Active Learning (OAL) aims to manage unlabeled datastream by selectively querying the label of data. OAL is applicable to many real-world problems, such as anomaly detection in health-care and finance. In these problems, there are two key challenges: the query budget is often limited; the ratio between classes i…

2019-11-18abs ↗pdf ↗

Study collaborative learning among multi-agents in multi-armed bandits.

problem Minimizing group cumulative regret in a heterogeneous multi-agent setting.
method Developed decentralized algorithms for collaboration between NN agents learning MM stochastic multi-armed bandits.
result Proved near-optimal behavior of proposed algorithms for group regret.

DEMVC improves multi-view clustering with collaborative training and deep autoencoders.

problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.

This paper applies Thompson Sampling to asymmetric α\alpha-stable bandits for financial and wireless data.

problem Optimizing exploration-exploitation in multi-armed bandits with asymmetric α\alpha-stable distributions.
method Thompson Sampling applied to unknown asymmetric α\alpha-stable reward distributions.
result Demonstrates effectiveness of Thompson Sampling for asymmetric α\alpha-stable bandits.

Machine learning improves beta forecasts, enhancing equity valuation and portfolio performance.

problem Improving beta forecasts for better equity valuation and portfolio performance.
method Using machine learning on a large cross-section of US stocks with various firm characteristics.
result Machine learning improves out-of-sample performance of asymmetric beta measures.

Proposes a method to generate prediction intervals using weighted asymmetric loss functions.

problem Generating reliable prediction intervals for neural network models.
method Uses a weighted asymmetric loss function to estimate prediction intervals.
result The method produces reliable prediction intervals in complex machine learning scenarios.

Study binary choice with asymmetric loss, offering simple solutions.

problem Binary choice with asymmetric loss in data-rich environments.
method Loss-based reweighting of logistic regression or machine learning techniques.
result Valid decisions on binary outcomes with general loss functions.

PCL tackles collaborative learning for diverse agents, reducing sample complexity.

problem Balancing collaborative speedup with personalization for heterogeneous agents.
method AffPCL, with bias and importance correction mechanisms.
result AffPCL reduces sample complexity by a factor of max{n1,δ}\max\{n^{-1}, δ\}, where nn is the number of agents and δ[0,1]δ\in[0,1] measures heterogeneity.

Despite the non-convex nature of their loss functions, deep neural networks are known to generalize well when optimized with stochastic gradient descent (SGD). Recent work conjectures that SGD with proper configuration is able to find wide and flat local minima, which have been proposed to be associated with good gener…

2019-02-02abs ↗pdf ↗

In this paper we examine the effect of applying ensemble learning to the performance of collaborative filtering methods. We present several systematic approaches for generating an ensemble of collaborative filtering models based on a single collaborative filtering algorithm (single-model or homogeneous ensemble). We pr…

2012-11-13abs ↗pdf ↗