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

275481108 · May 202619922001200920172026
48 results for max-min rule

Develops optimal decision-making framework for uncertain counterfactuals.

problem Ensuring reliability of predictions in high-stakes decisions.
method Policy-Coupled Risk-Averse Conformal Prediction (PC-RACP).
result Optimal prediction sets for counterfactual decisions with valid coverage.

Max-min margin Markov networks improve consistency in structured prediction.

problem Statistical inconsistency in max-margin methods for structured prediction.
method Defining a max-min margin formulation to overcome statistical inconsistency.
result Proves consistency and provides an explicit algorithm with finite sample generalization bounds.

In a pathbreaking paper, Cover and Ordentlich (1998) solved a max-min portfolio game between a trader (who picks an entire trading algorithm, θ()θ(\cdot)) and "nature," who picks the matrix XX of gross-returns of all stocks in all periods. Their (zero-sum) game has the payoff kernel Wθ(X)/D(X)W_θ(X)/D(X), where Wθ(X)W_θ(X) is the…

2018-10-04abs ↗pdf ↗

We derive a closed form portfolio optimization rule for an investor who is diffident about mean return and volatility estimates, and has a CRRA utility. The novelty is that confidence is here represented using ellipsoidal uncertainty sets for the drift, given a volatility realization. This specification affords a simpl…

2015-02-10abs ↗pdf ↗

Let MM be a stratum of a compact stratified space AA. It is equipped with a general adapted metric gg, which is slightly more general than the adapted metrics of Nagase and Brasselet-Hector-Saralegi. In particular, gg has a general type, which is an extension of the type of an adapted metric. A restriction on this …

2015-07-27abs ↗pdf ↗

This paper derives a robust on-line equity trading algorithm that achieves the greatest possible percentage of the final wealth of the best pairs rebalancing rule in hindsight. A pairs rebalancing rule chooses some pair of stocks in the market and then perpetually executes rebalancing trades so as to maintain a target …

2018-10-04abs ↗pdf ↗

Optimal best arm identification for multi-objective bandits with fixed error probability.

problem Identifying the best arm for each of multiple objectives with fixed confidence.
method Surrogate proportions to sample arms at each time step, eliminating max-min optimisation.
result Asymptotically optimal algorithm for multi-objective best arm identification.

A new method solves the projection robust Wasserstein distance problem efficiently.

problem Computing the projection robust Wasserstein distance is challenging due to the curse of dimensionality.
method Riemannian block coordinate descent (RBCD) method to solve the regularized max-min problem over the Stiefel manifold.
result RBCD method significantly improves the complexity of obtaining an ε-stationary point compared to existing methods.

ARL improves fairness without protected features, showing AUC improvements for worst-case groups.

problem Training fairness in ML without known protected features.
method Adversarially Reweighted Learning (ARL) using non-protected features and task labels.
result ARL improves Rawlsian Max-Min fairness with notable AUC improvements for worst-case groups.

The motivation of this work is to improve the performance of standard stacking approaches or ensembles, which are composed of simple, heterogeneous base models, through the integration of the generation and selection stages for regression problems. We propose two extensions to the standard stacking approach. In the fir…

2014-03-28abs ↗pdf ↗

The paper identifies all ε-optimal arms in a bandit problem with Gaussian rewards.

problem Identifying all ε-optimal arms in a finite stochastic multi-armed bandit with Gaussian rewards.
method The paper provides two lower bounds and a Track-and-Stop strategy to solve the problem, with an efficient numerical method to solve the convex max-min program.
result The Track-and-Stop strategy has asymptotically optimal average sample complexity in the regime of low risk.

New framework for fair online allocation in continuous time with deadlines.

problem Fair allocation under deadlines in continuous-time online learning.
method Continuous-time utility maximization, dual ascent optimization for time averages.
result Achieves ildeO(B1/2) ilde{O}(B^{-1/2}) regret bound in the absence of statistical knowledge.

Two approaches integrate qualitative views into portfolio optimization, showing aggregation methods outperform robust optimization.

problem Incorporating qualitative views into portfolio optimization models.
method Robust optimization and order aggregation methods.
result Aggregation methods outperform robust optimization in portfolio performance analysis.

We introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of the Freiheitssatz in the presence of directed diagrammatic reducibility is given.…

2019-03-11abs ↗pdf ↗

Framework predicts and prepares for rain-induced microwave link attenuation.

problem Severe signal attenuation due to weather conditions degrades network performance.
method Predictive Network Reconfiguration (PNR) framework using LSTM for attenuation prediction and MSNR for dynamic routing.
result Framework improves network utilization by more than 200% compared to reactive algorithms.

We introduce a dynamic credit portfolio framework where optimal investment strategies are robust against misspecifications of the reference credit model. The risk-averse investor models his fear of credit risk misspecification by considering a set of plausible alternatives whose expected log likelihood ratios are penal…

2016-03-27abs ↗pdf ↗

Develops optimal uncertainty quantification for risk-averse decision makers.

problem Quantifying prediction uncertainty for risk-sensitive domains.
method Decision-theoretic foundations connecting uncertainty quantification with risk-averse decision-making.
result Risk-Averse Calibration (RAC) algorithm provides optimal prediction sets for risk-averse decision makers.

Considering the classification problem, we summarize the nonparallel support vector machines with the nonparallel hyperplanes to two types of frameworks. The first type constructs the hyperplanes separately. It solves a series of small optimization problems to obtain a series of hyperplanes, but is hard to measure the …

2019-10-22abs ↗pdf ↗

A neural framework corrects bias in estimating individual treatment effects.

problem Estimating individual treatment effects from observational data.
method An anchored neural architecture and precision-corrected intersection-bound inference.
result Corrected bias and maintained nominal coverage in high-dimensional settings.

Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problem. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basic matrix and a nonnegative coefficient matrix, and the coefficient matrix is used as the new representation. …

2013-12-05abs ↗pdf ↗

Wasserstein distributionally robust optimization estimators are obtained as solutions of min-max problems in which the statistician selects a parameter minimizing the worst-case loss among all probability models within a certain distance (in a Wasserstein sense) from the underlying empirical measure. While motivated by…

2019-06-04abs ↗pdf ↗

Muon dynamics study uses spectral Wasserstein flow for optimization stability.

problem Optimizing deep learning models with gradient normalization.
method Introduces Spectral Wasserstein distances for matrix flows, proving equivalence with Benamou--Brenier formulation.
result Gradient-flow interpretation of mean-field normalized training dynamics.

DeepCTRL integrates rules into deep learning models, allowing flexible control at inference.

problem Lack of flexibility in incorporating rules into deep learning models.
method Integrates rule representations into deep neural networks, enabling flexible control at inference.
result Improves rule verification ratio and accuracy gains at downstream tasks.

New methods prune unpromising rules from KGs, improving scalability and runtime.

problem Scalability issues in walk-based rule learning from KGs.
method Rule Hierarchy Framework (RHF) and Hierarchical Pruning (HPMs).
result Significant reductions in runtime and number of learned rules without compromising predictive performance.

In this study, we give the relationships between the conical curvatures of ruled surfaces drawn by the unit vectors of the ruling, central normal and central tangent of a regular ruled surface in the Euclidean -space. We obtain the differential equations characterizing slant ruled surfaces and if the reference ruled su…

2013-11-27abs ↗pdf ↗

New framework learns interpretable rule ensembles without sacrificing accuracy.

problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.

Paper classifies ruled surfaces in Lorentz-Minkowski space for a specific flow.

problem Classifying ruled surfaces in Lorentz-Minkowski space.
method Examining homothetic self-similar solutions of the inverse mean curvature flow.
result Existence of two classes of non-cylindrical homothetic solitons.

In this study, we define some new types of ruled surfaces called slant ruled surfaces. We give some characterizations for a regular ruled surface to be a slant ruled surface in Euclidean 3- space. We show that if the slant ruled surface is developable then the striction curve is a general helix or a slant helix accordi…

2013-11-04abs ↗pdf ↗

In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…

2012-05-21abs ↗pdf ↗

Advances rule-based multi-label classification using conformal prediction.

problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.

We reduce a broad class of machine learning problems, usually addressed by EM or sampling, to the problem of finding the kk extremal rays spanning the conical hull of a data point set. These kk "anchors" lead to a global solution and a more interpretable model that can even outperform EM and sampling on generalizatio…

2014-06-22abs ↗pdf ↗

In this paper, we consider non developable ruled surface with spacelike ruling, timelike ruling, respectively. We give the relations between the structure functions with the curvature and torsion of the striction line of the timelike and spacelike non developable ruled surfaces. Also, we have calculated the gaussian an…

2014-03-05abs ↗pdf ↗

The Lamarle Formula, given by Kruppa in \cite{Kr}, is known as a relationship between the Gaussian curvature and the distribution parameter of a ruled surface in the surface theory. The ruled surfaces were investigated in 3 different classes with respect to the character of base curves and rulings, \cite{Tu1},\cite{Tu2…

2010-01-05abs ↗pdf ↗

In this study, we introduce Darboux slant ruled surfaces in the Euclidean 3-space which is defined by the property that the Darboux vector of orthonormel frame of ruled surface makes a constant angle with a fixed, non-zero direction. We obtain the characterizations of Darboux slant ruled surfaces regarding the conical …

2013-11-04abs ↗pdf ↗