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

71143214285 · Jun 202019922001200920172026
48 results for Tsallis losses

This work generalizes calibeating for a broader range of proper losses using Bregman divergence.

problem Calibration for a wide range of proper losses beyond Brier and log loss.
method Regret minimization based on Bregman divergence for a family of proper losses.
result U-calibration results for a family of Tsallis losses with logarithmic regret and dimension independence.

New loss functions based on f-divergences improve language model performance.

problem Improving multiclass classification and language modeling performance.
method Constructing new convex loss functions using f-divergences and deriving an operator for computation.
result The αα-divergence loss function with α=1.5α=1.5 performs well across various tasks.

This paper develops sparse alternatives to continuous distributions, including new types of Gaussians and attention mechanisms.

problem Creating flexible continuous distributions with varying support for machine learning applications.
method Defining ΩΩ-regularized prediction maps and Fenchel-Young losses for arbitrary domains, and deriving new types of Gaussians and attention mechanisms.
result Sparse alternatives to continuous distributions, including deformed exponential families and ββ-Gaussians, are introduced.

Improves policy optimization with polylog(T) regret bounds for stochastic losses.

problem Improves theoretical guarantees for policy optimization in stochastic settings.
method Leverages Tsallis and Shannon entropy regularizers for polylog(T) regret, and log-barrier regularizer for adversarial settings.
result Achieves a first-order polylog(T) regret bound for policy optimization in stochastic settings.

Gradient descent converges with arbitrary stepsize for separable data under Fenchel-Young losses.

problem Understanding the conditions under which gradient descent converges with arbitrary stepsize.
method Using Fenchel-Young losses and leveraging the classical perceptron argument to derive convergence rates.
result GD converges with arbitrary stepsize for a majority of Fenchel-Young losses, with better rates for specific loss functions.

We develop a variant of multiclass logistic regression that is significantly more robust to noise. The algorithm has one weight vector per class and the surrogate loss is a function of the linear activations (one per class). The surrogate loss of an example with linear activation vector a\mathbf{a} and class cc has t…

2017-05-19abs ↗pdf ↗

Modified Bakry-Émery criterion inequality for Tsallis entropy monotonicity.

problem Establishing improved logarithmic Sobolev inequalities and monotonicity of Tsallis entropy.
method Proving a one-parameter family of weighted Bakry-Émery Γ2Γ_2 criterion inequalities and a modified inequality.
result Yields a family of sharp Sobolev inequalities and monotonicity of Tsallis entropy.

Paper finds a new principle for optimizing consumption and wealth using Tsallis entropy.

problem Optimal consumption-investment problem with recursive utility.
method Established connection to quadratic BSDE, derived stochastic maximum principle.
result Proved existence of optimal strategy and analyzed coupled system.

The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. ID3, C4.5 and CART are classical decision tree algorithms and the split criteria they…

2015-11-25abs ↗pdf ↗

We derive an algorithm that achieves the optimal (within constants) pseudo-regret in both adversarial and stochastic multi-armed bandits without prior knowledge of the regime and time horizon. The algorithm is based on online mirror descent (OMD) with Tsallis entropy regularization with power α=1/2α=1/2 and reduced-varian…

2018-07-19abs ↗pdf ↗

We introduce a temperature into the exponential function and replace the softmax output layer of neural nets by a high temperature generalization. Similarly, the logarithm in the log loss we use for training is replaced by a low temperature logarithm. By tuning the two temperatures we create loss functions that are non…

2019-06-08abs ↗pdf ↗

Develops a Best-of-Both-Worlds algorithm for linear contextual bandits with Tsallis entropy.

problem Linear contextual bandits with i.i.d. contexts.
method Follow-The-Regularized-Leader (FTRL) with Tsallis entropy.
result Achieves $O\left(\log(T)^{\frac{1+β}{2+β}}T^{\frac{1}{2+β}} ight)$ regret under margin condition.

Estimate relaxation times in nonextensive systems using gradient flow for Tsallis entropy maximization.

problem Estimating relaxation times in financial market dynamics.
method Developing a method using EGF for maximizing Tsallis entropy.
result Longer relaxation times for nonextensive systems compared to Shannon entropy.

A hybrid impurity measure balances theoretical soundness and computational efficiency.

problem Developing a robust impurity measure for decision trees.
method Integrates Tsallis entropy with an exponential polarization component.
result Simple parametric measures outperform ITC, but ITC variants are competitive with strong theoretical guarantees.

Improved regret bounds for Tsallis-INF in adversarial bandits and corruptions.

problem Adversarial bandits and corruptions in multiarmed bandit problems.
method Improved regret bounds for Tsallis-INF algorithm.
result Achieves $\mathcal{O}\left(\left(\sum_{i eq i^*} \frac{1}{Δ_i} ight)\log_+\left(\frac{(K-1)T}{\left(\sum_{i eq i^*} \frac{1}{Δ_i} ight)^2} ight)+\sqrt{C\left(\sum_{i eq i^*}\frac{1}{Δ_i} ight)\log_+\left(\frac{(K-1)T}{C\sum_{i eq i^*}\frac{1}{Δ_i}} ight)} ight)$ regret bound.

The paper sets lower bounds for adversarial robustness in multiclass classification.

problem Adversarial robustness in multiclass classification with arbitrary loss functions.
method Dual and barycentric reformulations for robust risk minimization.
result Sharp lower bounds for adversarial risks are computed efficiently.

This paper introduces a new potential function using Tsallis entropy for neural network optimization.

problem The challenge of obtaining exponential convergence in neural network optimization.
method Utilizes a linearized potential function based on Csiszár type of Tsallis entropy.
result Derives an exponential convergence result in neural network optimization.

This study uses Tsallis entropy to analyze diversification and integration in Italian stock market companies.

problem Examining the industrial structure and market reactions of cross-shareholding networks.
method Developed Tsallis entropy approach to model diversification and integration using copulas.
result Entropy analysis reveals insights into market polarisation and fairness.

Study analyzes stock market dynamics using Tsallis statistics and GHE, revealing pre-bubble and post-bubble market characteristics.

problem Understanding stock market dynamics and predicting market bubbles.
method Non-linear analysis using time-dependent Tsallis statistics and Generalized Hurst Exponents.
result Temporal trends of q-triplet values differ before and after market bubbles, indicating significant market dynamics changes.

Paper presents characteristic function of Tsallis q-Gaussian and its applications.

problem Modeling input quantities in measurement models using Tsallis q-Gaussians.
method Developed a characteristic function and proposed a numerical method for its inversion.
result Exact probability distribution of output quantities can be determined.

In this paper, we propose a novel maximum causal Tsallis entropy (MCTE) framework for imitation learning which can efficiently learn a sparse multi-modal policy distribution from demonstrations. We provide the full mathematical analysis of the proposed framework. First, the optimal solution of an MCTE problem is shown …

2018-05-22abs ↗pdf ↗

We find the wealth distribution for an economic agent in the financial market, in analogy with standard derivation of generaliz Boltzman (Tsallis) factor in statistical mechanics. In this respect, Tsallis entropic index separates two different regimes, the large and small size market. The Pareto like wealth distributio…

2004-04-28abs ↗pdf ↗

Study on utility maximization with Tsallis entropy in reinforcement learning.

problem Exploring utility maximization with Tsallis entropy in reinforcement learning.
method Introducing Tsallis entropy regularizer to induce exploration, investigating specific examples, characterizing well-posedness, designing reinforcement learning algorithm.
result Characterized well-posedness and provided semi-closed-form solutions for specific examples, found distinct optimal strategies.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

This work models financial market returns with asymmetric Tsallis distributions, improving fit over symmetric q-Gaussians.

problem Non-symmetric behavior of stock market returns over time scales.
method Linear combination of two independent normalized half q-Gaussians with different parameters.
result Asymmetric distributions provide better fits to stock market returns than symmetric q-Gaussians, especially over longer time scales.

We developed a strategic of optimal portfolio based on information theory and Tsallis statistics. The growth rate of a stock market is defined by using qq-deformed functions and we find that the wealth after n days with the optimal portfolio is given by a qq-exponential function. In this context, the asymptotic optim…

2018-11-17abs ↗pdf ↗

A pricing principle is introduced for non-attainable claims in incomplete markets.

problem Pricing non-attainable contingent claims in incomplete markets.
method Distorted Radon-Nikodym derivative and Tsallis relative entropy over a family of equivalent martingale measures.
result The pricing principle is closely related to backward stochastic differential equations and is arbitrage-free and time-consistent.

New method uses asymmetric Tsallis relative entropy for better risk assessment in financial portfolios.

problem Improving risk assessment for financial portfolios using asymmetric data.
method Generalized Tsallis relative entropy (ATRE) for asymmetric distributions of returns.
result ATRE shows better risk-return profiles, especially during market crashes.

The theoretical basis for a candidate variational principle for the information bottleneck (IB) method is formulated within the ambit of the generalized nonadditive statistics of Tsallis. Given a nonadditivity parameter q q , the role of the \textit{additive duality} of nonadditive statistics (q=2q q^*=2-q ) in relating…

2008-11-19abs ↗pdf ↗

In this paper we study the possible microscopic origin of heavy-tailed probability density distributions for the price variation of financial instruments. We extend the standard log-normal process to include another random component in the so-called stochastic volatility models. We study these models under an assumptio…

2007-05-29abs ↗pdf ↗

One of the major issues studied in finance that has always intrigued, both scholars and practitioners, and to which no unified theory has yet been discovered, is the reason why prices move over time. Since there are several well-known traditional techniques in the literature to measure stock market volatility, a centra…

2008-09-26abs ↗pdf ↗

Near-optimal per-action regret bounds for sleeping bandits are derived.

problem Optimizing performance in sleeping bandits where arms and losses are chosen by an adversary.
method Directly minimizing per-action regret using generalized versions of EXP3, EXP3-IX, and FTRL with Tsallis entropy.
result Near-optimal bounds of order O(TAlnK)O(\sqrt{TA\ln{K}}) and O(TAK)O(\sqrt{T\sqrt{AK}}) are obtained.
Financial Market Dynamicscond-mat.stat-mech

Distributions derived from non-extensive Tsallis statistics are closely connected with dynamics described by a nonlinear Fokker-Planck equation. The combination shows promise in describing stochastic processes with power-law distributions and superdiffusive dynamics. We investigate intra-day price changes in the S&P500…

2001-08-01abs ↗pdf ↗