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

4896144192 · Jun 202019922001200920172026
48 results for Rule Following

Wittgenstein's Rule Following evolves datasets by extrapolating structural descriptors.

problem Generating meaningful continuations of evolving datasets.
method Wittgenstein's Rule Following (WRF) uses structural descriptors to extrapolate trajectories and average historical descriptors.
result WRF can generate meaningful continuations of evolving datasets.

Pareto's 80/20 rule follows a Gaussian distribution with twice the mean standard deviation.

problem Understanding variations in the 80/20 rule across different contexts.
method Identifying the statistical distribution of the 80/20 rule and its variations.
result The 80/20 rule follows a Gaussian distribution with a standard deviation twice the mean.

Abstraction and realization are bilateral processes that are key in deriving intelligence and creativity. In many domains, the two processes are approached through rules: high-level principles that reveal invariances within similar yet diverse examples. Under a probabilistic setting for discrete input spaces, we focus …

2017-09-06abs ↗pdf ↗

Develops a new model for controllable and realistic traffic simulation.

problem Lack of models that offer both controllability and realism in traffic simulation.
method Guided Conditional Diffusion (CTG) model using diffusion modeling and differentiable logic.
result Improves controllability-realism tradeoff over strong baselines.

Calibrating a trading rule using a historical simulation (also called backtest) contributes to backtest overfitting, which in turn leads to underperformance. In this paper we propose a procedure for determining the optimal trading rule (OTR) without running alternative model configurations through a backtest engine. We…

2014-08-06abs ↗pdf ↗

Coordinate descent methods employ random partial updates of decision variables in order to solve huge-scale convex optimization problems. In this work, we introduce new adaptive rules for the random selection of their updates. By adaptive, we mean that our selection rules are based on the dual residual or the primal-du…

2017-03-07abs ↗pdf ↗

Given a smooth distribution D\mathscr{D} of mm-dimensional planes along a smooth regular curve γγ in Rm+n\mathbb{R}^{m+n}, we consider the following problem: to find an mm-dimensional rank-one submanifold of Rm+n\mathbb{R}^{m+n}, that is, an (m1)(m-1)-ruled submanifold with constant tangent space along the rulings, such …

2018-11-20abs ↗pdf ↗

We consider the setting of sequential prediction of arbitrary sequences based on specialized experts. We first provide a review of the relevant literature and present two theoretical contributions: a general analysis of the specialist aggregation rule of Freund et al. (1997) and an adaptation of fixed-share rules of He…

2012-07-09abs ↗pdf ↗

A quantitative check of weak efficiency in US dollar/German mark exchange rates is developed using high frequency data. We show the existence of long term return anomalies. We introduce a technique to measure the available information and show it can be profitable following a particular trading rule.

1999-01-21abs ↗pdf ↗

The paper examines how macroeconomic control tools lost effectiveness, leading to a 'dark ages' period.

problem Loss of effectiveness of control tools in macroeconomic stabilization policy.
method Historical analysis of macroeconomic stabilization policy from 1948 to 1993.
result The overstatement of the Lucas critique and Kydland and Prescott's time-inconsistency led to a period of ineffective stabilization policy.

New method improves model explainability and accuracy with low computational cost.

problem Improving model explainability and accuracy in classification models.
method Distributionally robust optimization to learn sparse ensembles of rule sets.
result Improves model performance on various metrics compared to competing methods.

Signature kernel scoring rule improves weather forecasting by capturing temporal and spatial dependencies.

problem Lack of suitable scoring rules for probabilistic weather forecasting.
method Reframe weather variables as continuous paths using iterated integrals (signature kernels) to capture temporal and spatial dependencies.
result Signature kernel scoring rule outperforms conventional methods in weather forecasting, especially for long-term forecasts.

This paper solves aggregation of Pareto optimal models by using Bayesian priors and weighted averaging.

problem How to rationally aggregate Pareto optimal models while preserving Pareto efficiency.
method Four logical steps: 1) Bayesian models, 2) Prior as preference ranking, 3) Consistent aggregation, 4) Weighted average of priors.
result All rational/consistent aggregation rules follow a generalized hierarchical Bayesian model.

Reinforcement Learning improves insulin bolus decisions for type-I diabetes patients.

problem Optimal insulin bolus decisions for type-I diabetes patients are not well-established.
method Applied Reinforcement Learning to simulated T1DM data.
result Optimal bolus rule differs from standard advisors and can prevent hypoglycemia.

This paper analyzes voter coalitions in MakerDAO's decentralized governance.

problem Understanding the governance structure and influence of voter coalitions in DAOs.
method Applied clustering algorithm to voting history of MakerDAO to identify voter coalitions.
result The emergence of a dominant voter coalition signals governance centralization in DAOs.

The paper proposes multicalibration to improve matching in graphs with imperfect predictors.

problem Finding the best matching in graphs with imperfect predictors.
method Introduces multicalibration as a fairness notion to ensure unbiasedness on protected sets of contexts.
result Constructing a multicalibrated predictor that outperforms standard optimal rules in matching algorithms.

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don't increase the stepsize too fast and 2) don't overstep the local curvature. No need for functional values, no line search, no information about the function except for the gradients. By following these rules, you get…

2019-10-21abs ↗pdf ↗

Neural operators learn to solve LQ MFGs efficiently in infinite dimensions.

problem Solving many related LQ MFG problems in infinite-dimensional settings.
method Training neural operators to map problem data to equilibrium strategies.
result NOs reliably solve unseen LQ MFG variants with controlled parameters.

Optimal strategy found for identifying best arm in bandits with small gap.

problem Best arm identification in two-armed bandits with a fixed budget and small gap.
method Neyman allocation rule augmented with inverse probability weighting.
result Proposed strategy is asymptotically optimal when gap is small.

This paper uses Bayesian models to analyze CTA returns across short and long-term trends.

problem The relative merits and interactions of short- and long-term trend systems in CTA replication remain controversial.
method Dynamic decomposition of CTA returns into short-term trend, long-term trend, and market beta factors using a Bayesian graphical model.
result The blend of horizons shapes the strategy's risk-adjusted performance.

New rule reduces exploration regret to logarithmic, improving bad episode handling.

problem Improving exploration regret in average reward MDPs.
method Replacing Doubling Trick with Vanishing Multiplicative rule in EVI-based algorithms.
result Regret is logarithmic under the new rule, significantly better than linear.

We analyze a model of learning and belief formation in networks in which agents follow Bayes rule yet they do not recall their history of past observations and cannot reason about how other agents' beliefs are formed. They do so by making rational inferences about their observations which include a sequence of independ…

2015-09-30abs ↗pdf ↗

This paper proposes a new method to approximate posterior distributions using generative neural networks trained via scoring rule minimization.

problem Bayesian Likelihood-Free Inference for models with intractable likelihood.
method Approximate posterior with generative neural networks trained via scoring rule minimization, avoiding the instability of adversarial training.
result Scoring Rule minimization leads to better performance and uncertainty quantification compared to adversarial training.

This thesis consists of two independent parts: random matrices, which form the first one-third of this thesis, and machine learning, which constitutes the remaining part. The main results of this thesis are as follows: a necessary and sufficient condition for the inverse moments of (m,n,β)(m,n,β)-Laguerre matrices and compo…

2018-07-25abs ↗pdf ↗

The paper proves the existence of a special Kähler metric on a minimal ruled surface.

problem Existence of higher extremal Kähler metrics on a minimal ruled surface.
method Proved the existence of a higher extremal Kähler metric by showing it satisfies a specific equation and computed the top Bando-Futaki invariant.
result Higher extremal Kähler metrics exist on a minimal ruled surface, but not higher constant scalar curvature Kähler metrics.

Proposes a fuzzy rule-based method for data visualization.

problem Preserving neighborhood relationships and handling non-linear manifolds in data visualization.
method Uses a first-order Takagi-Sugeno model with clusters and Geodesic c-means clustering for rule generation and parameter estimation.
result Behaves desirably and performs better than or comparable to other methods.

Assume (1) asset returns follow a stochastic multi-factor process with time-varying conditional expectations; (2) investments are linear functions of factors. This paper calculates asymptotic joint moments of the logarithm of investor's wealth and the factors. These formulas enable fast computation of a wide range of i…

2003-04-11abs ↗pdf ↗

A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph representation of the optimization problem. The definitive relation between chordal extension and the performance of the optimization algorithm that uses the extension …

2019-10-16abs ↗pdf ↗

Study of symplectomorphisms on ruled surfaces under circle actions.

problem Homotopy type of equivariant symplectomorphisms on rational ruled surfaces.
method Analysis of action on compatible and invariant almost complex structures, use of Delzant's and Karshon's classifications.
result Equivariant symplectomorphisms are homotopy equivalent to tori or their pushout.

In supervised learning, an inductive learning algorithm extracts general rules from observed training instances, then the rules are applied to test instances. We show that this splitting of training and application arises naturally, in the classical setting, from a simple independence requirement with a physical interp…

2016-05-24abs ↗pdf ↗

We present a simple agent-based model of a financial system composed of leveraged investors such as banks that invest in stocks and manage their risk using a Value-at-Risk constraint, based on historical observations of asset prices. The Value-at-Risk constraint implies that when perceived risk is low, leverage is high…

2014-07-20abs ↗pdf ↗

New bounds prevent degradation in high-dimensional signal estimation.

problem Statistical learning bounds degradation with increasing dimensionality.
method Investigates linear prediction rules under structural assumptions.
result Derives upper and lower bounds on generalization error.

Adaptive learning rate improves FTRL's performance in online learning.

problem Optimizing FTRL's learning rate for competitive regret in online learning.
method Formulated as a sequential decision-making problem, introduced competitive analysis framework, and proposed stability-penalty matching update rules.
result Achieved a constant competitive ratio under specific conditions, enabling Best-Of-Both-Worlds algorithms.

New approach tackles decision-making under predictions that shape outcomes.

problem Challenges in learning optimal decision rules when predictions influence outcomes.
method Introduces performative omniprediction, a predictor that encodes optimal decision rules for multiple objectives.
result Efficient performative omnipredictors exist under a natural restriction of outcome performativity.

The transition of several East and Central European countries and the countries of the Former Soviet Union from the socialist economic system to the capitalist one is studied. A recently developed microeconomic model for the personal income distribution and its evolution and a simple functional relationship between the…

2008-11-07abs ↗pdf ↗

A new framework for paired-sample testing in high-dimensional data.

problem Challenges in standard paired-sample testing for high-dimensional data.
method Develops a two-step testing procedure using scoring functions and Wilcoxon signed-rank test.
result Substantial performance gains in testing accuracy compared to traditional methods.

The aim of this paper is to compare the performances of the optimal strategy under parameters mis-specification and of a technical analysis trading strategy. The setting we consider is that of a stochastic asset price model where the trend follows an unobservable Ornstein-Uhlenbeck process. For both strategies, we prov…

2016-04-30abs ↗pdf ↗

Trans-Ising combines auxiliary datasets to estimate high-dimensional Ising models.

problem Limited target sample sizes and difficulty in using auxiliary binary datasets of unknown relevance.
method Trans-Ising uses a loss-based source screening rule and a two-stage estimation procedure.
result Trans-Ising achieves lower estimation errors than target-only estimation and naive data pooling.