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,695 papers · 148 categories

Trend · papers per month

134268401535 · Jun 202019922001200920172026
48 results for second-order predictions

Paper discusses optimal CP for second-order predictions.

problem How to incorporate second-order predictions into conformal prediction.
method Introduces Bernoulli prediction sets (BPS) for second-order predictions and applies conformal risk control for compromised validity.
result BPS provides the smallest prediction sets with conditional coverage.

Proposes a new stock prediction method that accounts for market dynamics.

problem The dynamic nature of the stock market invalidates traditional machine learning assumptions.
method Develops a second-order learning paradigm with multi-scale patterns.
result Demonstrates effectiveness in stock prediction on real-world data.

Second-order economic theory considers new variables to improve price volatility predictions.

problem Current economic models focus on first-order variables, missing second-order variables that affect price volatility.
method Introduces second-order economic theory with new variables composed of sums of squares of agents' transactions.
result Second-order economic theory complements first-order variables and introduces new macroeconomic variables.

A new framework for measuring uncertainty in machine learning models.

problem Uncertainty measures for second-order distributions in machine learning models have theoretical flaws.
method Formal criteria and a general framework based on the Wasserstein distance.
result The Wasserstein distance-based measure satisfies all proposed criteria for meaningful uncertainty measures.

Improved prediction algorithm for 'easy' sequences with reduced regret.

problem Prediction with expert advice for 'easy' sequences.
method Variant of NormalHedge algorithm using second-order εε-quantile regret bound.
result Second-order εε-quantile regret bound of O(VTlog(VT/ε))O\big(\sqrt{V_T \log(V_T/ε)}\big) for VT>logNV_T > \log N.

New findings show second-order scoring rules can't accurately represent epistemic uncertainty.

problem Lack of epistemic uncertainty representation in second-order learners.
method Generalised second-order scoring rules introduced to prove theoretical limitations.
result No loss function incentivizes second-order learners to accurately represent epistemic uncertainty.

With the rapid adoption of machine learning systems in sensitive applications, there is an increasing need to make black-box models explainable. Often we want to identify an influential group of training samples in a particular test prediction for a given machine learning model. Existing influence functions tackle this…

2019-11-01abs ↗pdf ↗

Loss minimisation fails to capture epistemic uncertainty in second-order predictors.

problem Capturing epistemic uncertainty in machine learning models.
method Analysis of a second-order learner approach using loss minimisation.
result Loss minimisation does not faithfully represent epistemic uncertainty in second-order predictors.

Second-order methods fail to fully quantify epistemic uncertainty, leading to biased predictions.

problem Incomplete quantification of epistemic uncertainty in machine learning models.
method Analysis of existing second-order uncertainty estimation methods.
result Current methods overestimate aleatoric uncertainty and underestimate epistemic uncertainty, leading to biased predictions.

Paper introduces variance-based measures for second-order uncertainty quantification in classification problems.

problem Uncertainty in machine learning predictions and decision-making.
method Second-order uncertainty quantification using variance-based measures.
result Variance-based measures effectively quantify uncertainty on a class-based level and are competitive with entropy-based measures.

Data whitening and second order optimization harm generalization by reducing access to dataset information.

problem Harmful effects of data whitening and second order optimization on generalization in machine learning.
method Analysis of fully connected models and experimental verification.
result Data whitening and second order optimization reduce or prevent generalization by limiting access to dataset information.

Optimistic method adapted for faster convex-concave min-max problems.

problem Solving convex-concave min-max optimization problems efficiently.
method Adaptive, line search-free second-order methods combining optimistic updates and second-order information.
result Achieves optimal convergence rate without line search or backtracking.

This paper investigates different vector step-size adaptation approaches for non-stationary online, continual prediction problems. Vanilla stochastic gradient descent can be considerably improved by scaling the update with a vector of appropriately chosen step-sizes. Many methods, including AdaGrad, RMSProp, and AMSGra…

2019-07-17abs ↗pdf ↗

In this paper, we consider the problem of prediction with expert advice in dynamic environments. We choose tracking regret as the performance metric and develop two adaptive and efficient algorithms with data-dependent tracking regret bounds. The first algorithm achieves a second-order tracking regret bound, which impr…

2019-09-05abs ↗pdf ↗

Derives formulae for general permutation equivariant layers and presents a second order graph variational encoder.

problem Tackles the limitation of previous equivariant neural networks by considering permutations of matrices.
method Derives formulae for general permutation equivariant layers, including matrix permutations. Presents a second order graph variational encoder.
result Latent distribution of equivariant generative models must be exchangeable.

Improved robustness in optimization methods using second-order information.

problem Scalability and sensitivity to mini-batch size in optimization methods.
method Mini-Batch Stochastic Variance-Reduced Newton (extttMbSVRN exttt{Mb-SVRN}) algorithm incorporating partial second-order information.
result Achieves a fast linear convergence rate independent of mini-batch size for large data sizes.

We aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want …

2015-02-27abs ↗pdf ↗

GAPA method provides efficient uncertainty quantification for pretrained networks.

problem Reliable uncertainty estimates for pretrained models are challenging.
method Post-hoc Gaussian Process Activations (GAPA) method that shifts Bayesian modeling from weights to activations.
result GAPA method provides efficient uncertainty quantification without altering the backbone's predictions.

Solves Merton's investment-consumption problem with certainty equivalent approach.

problem Maximizing CRRA utility of consumption over time and investment mix.
method Identifies a certainty equivalent problem for the Merton problem, reformulates it as an SOCP, and applies it to model predictive control.
result The certainty equivalent problem can be solved as an SOCP, facilitating model predictive control.

Second-order optimizers retain residual information after data deletion, affecting machine unlearning.

problem Residual information in second-order optimizers after data deletion.
method Comparison of first-order and second-order learners, eigendecomposition analysis.
result Second-order optimizers retain residual information, not detectable by first-order analysis.

Exact second-order optimization for deep learning reduces computational cost and improves performance.

problem Inadequate use of second-order optimization methods in deep learning due to high computational cost and non-convexity.
method Developed an exact stochastic second-order Newton method that addresses the non-convexity issue and provides an expression for the stochastic Hessian.
result Exact second-order Newton direction formula and its application in deep learning datasets.

SOLBP extends efficient inference to uncertain Bayesian networks.

problem Inference in uncertain Bayesian networks with second-order probabilities.
method Extends Loopy Belief Propagation to second-order Bayesian networks.
result Generates inferences consistent with sum-product networks, more efficient and scalable.

Developed a theory of local convexity for second order differential equations on Lie algebroids.

problem Analyzing convexity in differential equations on Lie algebroids.
method Theory development for local convexity of SODEs on Lie algebroids.
result Extensive discussion of homogeneous quadratic SODEs on Lie algebroids.

Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient training algorithm for higher-order FMs (HOFMs). In this paper, we present the …

2016-07-25abs ↗pdf ↗

Paper examines risk measure expansions under FGM dependence, improving accuracy at extreme levels.

problem Capturing higher-order tail behavior and dependence effects in risk measures.
method Second-order asymptotic expansions using extreme value theory and regular variation theory.
result Second-order approximations reduce approximation errors, especially at extreme confidence levels.

We study online aggregation of the predictions of experts, and first show new second-order regret bounds in the standard setting, which are obtained via a version of the Prod algorithm (and also a version of the polynomially weighted average algorithm) with multiple learning rates. These bounds are in terms of excess l…

2014-02-10abs ↗pdf ↗

Negative step sizes improve second-order methods for neural networks.

problem Second-order methods discard negative curvature, limiting their effectiveness.
method Introduce negative step sizes in second-order methods combined with Wolfe line search.
result Negative step sizes lead to global convergence and improved performance.

Paper studies second order tail probabilities in risk models.

problem Analyzing tail probabilities in risk models with constant interest force.
method Asymptotic expansion and weighted Kesten-type inequality for second order subexponential random variables.
result Second order asymptotic formulae for continuous-time renewal risk models are derived.

Paper studies second order symmetric parallel tensors in generalized f.pk-space forms.

problem Exploring properties of second order symmetric parallel tensors in generalized f.pk-space forms.
method Analyzes the properties of second order symmetric parallel tensors and deduces the existence or non-existence of certain tensors and hypersurfaces.
result There does not exist second order skew-symmetric parallel tensor in f.pk-space form. There is no parallel hypersurface in a generalized f.pk-space form but there is semi-parallel hypersurface.

We introduce a new recursive aggregation procedure called Bernstein Online Aggregation (BOA). The exponential weights include an accuracy term and a second order term that is a proxy of the quadratic variation as in Hazan and Kale (2010). This second term stabilizes the procedure that is optimal in different senses. We…

2014-04-04abs ↗pdf ↗

Paper generalizes connections between Lie groups and affine connections.

problem Exploring properties of infinitesimal groups and affine connections.
method Introducing second-order infinitesimal groups and using them to define Lie brackets and connections.
result Generalized correspondence between symmetric and non-symmetric affine connections.

A method for inferring motility models and heterogeneity from particle trajectories.

problem Understanding motility patterns from discrete trajectory data of biological agents.
method Maximum likelihood approach for second-order Langevin models with population heterogeneity.
result The proposed method outperforms alternative approaches for short trajectories.

AdamQLR optimizes Adam with K-FAC heuristics, achieving comparable performance to tuned benchmarks.

problem Improving the performance of Adam optimizers with stabilizing heuristics.
method Combining Adam's update directions with K-FAC's heuristics (damping and learning rate selection).
result Untuned AdamQLR can achieve comparable performance to tuned benchmarks.

The quantification of diversification benefits due to risk aggregation plays a prominent role in the (regulatory) capital management of large firms within the financial industry. However, the complexity of today's risk landscape makes a quantifiable reduction of risk concentration a challenging task. In the present pap…

2009-10-13abs ↗pdf ↗