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

8162331 · Jun 202019922001200920172026
48 results for Selfish Mining

This paper analyzes the profitability of selfish mining on blockchain, considering the risk of ruin.

problem The profitability of selfish mining on blockchain, considering the risk of ruin.
method Formulated a stochastic model and used tools from applied probability and analysis to determine expected profit.
result Explicit expressions for expected profit under different scenarios were derived, identifying conditions for selfish mining as a strategic advantage.

New algorithm outperforms existing ones in multi-player bandit problems without sensing.

problem Decentralized multi-player multi-armed bandit problem without collision or sensing info.
method Randomized Selfish KL-UCB, inspired by Selfish KL-UCB, with low complexity.
result Randomized Selfish KL-UCB outperforms state-of-the-art algorithms in almost all environments.

New algorithm for multi-player bandits with selfish players, achieving logarithmic regret.

problem Challenges of robustness to selfish players in multi-player bandits.
method First algorithm robust to selfish players achieving logarithmic regret, with or without collision observation.
result Achieved logarithmic regret for robust algorithms to selfish players in multi-player bandits.

Standard economic theory, starting with Adam Smith's invisible hand, holds that those who trade for their own selfish motives of maximizing their private preferences may contribute more to the public wealth than those who claim altruistic motives. Under restrictive conditions, this has been shown to result from a self-…

2005-10-09abs ↗pdf ↗

New algorithm reduces regret in strategic prediction problem.

problem Designing an IC algorithm with sublinear regret for strategic experts.
method Developed a new algorithm WSU-UX and proved a worst-case regret bound.
result WSU-UX suffers a Ω(T2/3)Ω(T^{2/3}) lower bound on regret.

The paper explores how mining costs, rewards, and blockchain security are interconnected.

problem Understanding the interdependencies between mining costs, mining rewards, and blockchain security.
method Theoretical derivation and empirical analysis using daily crypto market data and autoregressive distributed lag approach.
result Cryptocurrency price and mining rewards are intrinsically linked to blockchain security outcomes.

Data mining is about obtaining new knowledge from existing datasets. However, the data in the existing datasets can be scattered, noisy, and even incomplete. Although lots of effort is spent on developing or fine-tuning data mining models to make them more robust to the noise of the input data, their qualities still st…

2019-06-20abs ↗pdf ↗

We argue that the estimation of mutual information between high dimensional continuous random variables can be achieved by gradient descent over neural networks. We present a Mutual Information Neural Estimator (MINE) that is linearly scalable in dimensionality as well as in sample size, trainable through back-prop, an…

2018-01-12abs ↗pdf ↗

Study shows Bitcoin mining with surplus electricity can boost KEPCO's financial stability.

problem Improving energy resource efficiency and reducing KEPCO's debt.
method Utilized surplus electricity for Bitcoin mining using Antminer S21 XP Hyd, analyzed with Random Forest Regressor and Long Short-Term Memory models.
result Bitcoin mining with surplus electricity generates economic revenue, minimizes energy loss, and resolves payment issues for KEPCO.

A new framework for mining high utility patterns in interval-based sequences.

problem Mining patterns in events that persist over varying time intervals and considering event utility.
method Integrates utility into interval-based sequences and proposes HUIPMiner algorithm with pruning strategy.
result HUIPMiner efficiently finds high utility patterns in real datasets.

The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little attention in data mining so far. In this paper, we therefore addresses the problem…

2018-06-15abs ↗pdf ↗

QuantaAlpha uses evolutionary algorithms to mine financial alpha robustly across market distributions.

problem Challenges in alpha mining due to market noise and regime shifts.
method Evolutionary framework treating each mining run as a trajectory, mutation, crossover, targeted revision, and reuse of effective patterns.
result Consistent gains over strong baselines and prior systems, achieving high IC and ARR.

AlphaEval evaluates alpha mining models efficiently and comprehensively.

problem Lack of systematic evaluation for alpha mining models.
method Unified, parallelizable evaluation framework assessing predictive power, stability, robustness, financial logic, and diversity.
result AlphaEval achieves evaluation consistency comparable to comprehensive backtesting, providing more comprehensive insights and higher efficiency.

Multi-player Multi-Armed Bandits (MAB) have been extensively studied in the literature, motivated by applications to Cognitive Radio systems. Driven by such applications as well, we motivate the introduction of several levels of feedback for multi-player MAB algorithms. Most existing work assume that sensing informatio…

2017-11-07abs ↗pdf ↗

Recent sequential pattern mining methods have used the minimum description length (MDL) principle to define an encoding scheme which describes an algorithm for mining the most compressing patterns in a database. We present a novel subsequence interleaving model based on a probabilistic model of the sequence database, w…

2016-02-16abs ↗pdf ↗

AlphaForge mines and dynamically combines alpha factors for better investment performance.

problem Inconsistency and inflexibility of fixed factor weights in alpha factor mining.
method Generative-predictive neural network for factor generation and dynamic weight adjustment.
result Demonstrated superior performance in formulaic alpha factor mining and portfolio returns.

The purpose of this study is to estimate the production function and examine the structure of production in the mining sector of Iran. Several studies have already been conducted in estimating production functions of various economic sectors; however, less attention has been paid to mining sectors. After examining the …

2015-09-12abs ↗pdf ↗

AlphaSAGE mines diverse alphas via GFlowNets, overcoming RL issues.

problem Reward sparsity, inadequate sequential representations, and single optimal mode issues in RL for alphas.
method Structure-aware encoder (RGCN), GFlowNets, dense reward structure.
result Empirically outperforms existing baselines in mining diverse alphas.

In the field of exploratory data mining, local structure in data can be described by patterns and discovered by mining algorithms. Although many solutions have been proposed to address the redundancy problems in pattern mining, most of them either provide succinct pattern sets or take the interests of the user into acc…

2017-02-07abs ↗pdf ↗

With the growing interest on Network Analysis, Relational Data Mining is becoming an emphasized domain of Data Mining. This paper addresses the problem of extracting representative elements from a relational dataset. After defining the notion of degree of representativeness, computed using the Borda aggregation procedu…

2012-07-03abs ↗pdf ↗

Deep metric learning aims to learn a deep embedding that can capture the semantic similarity of data points. Given the availability of massive training samples, deep metric learning is known to suffer from slow convergence due to a large fraction of trivial samples. Therefore, most existing methods generally resort to …

2018-11-04abs ↗pdf ↗

Paper presents a framework to automatically discover constraints from data.

problem Discovering constraints from data for structured output prediction.
method Formulates structured output prediction as ILP, mines constraints by estimating polytopes of feasible set.
result Successfully identifies feasible sets and constraints for various tasks.

Confidence intervals improve evaluation of binary prediction rules in data mining.

problem Uncertainty in performance measures estimation from finite datasets.
method Asymptotic normal approximations for confidence intervals, with a blurring correction.
result Improved finite sample coverage probabilities and general performance measures inference.