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.

169,341 papers · 148 categories

Trend · papers per month

35810 · Jul 202019922001200920182026
48 results for merit

New algorithms ensure fair selection in combinatorial semi-bandit with unrestricted delays.

problem Fair selection in stochastic combinatorial semi-bandit with delayed feedback.
method Introduced merit-based fairness constraints and new bandit algorithms for reward and fairness.
result Achieved sublinear expected reward and fairness regrets with dependence on delay distribution quantiles.

An on-going debate in the energy economics and power market community has raised the question if energy-only power markets are increasingly failing due to growing feed-in shares from subsidized renewable energy sources (RES). The short answer to this is: No, they are not failing. Energy-based power markets are, however…

2013-07-01abs ↗pdf ↗

The paper connects DNN generalization to node SNR using information theory.

problem Exploring the reasons behind DNN generalization performance.
method Using information theory, the paper derives SNR expressions for DNN nodes and uses them to quantify weight optimization.
result Good SNR performance in DNN nodes correlates with good generalization.

A novel linear classification method that possesses the merits of both the Support Vector Machine (SVM) and the Distance-weighted Discrimination (DWD) is proposed in this article. The proposed Distance-weighted Support Vector Machine method can be viewed as a hybrid of SVM and DWD that finds the classification directio…

2013-10-11abs ↗pdf ↗

Proposes a fair RMAB framework ensuring equal exposure to arms.

problem Fairness in RMABs where arms are not equally exposed.
method Defines merit of each arm based on stationary reward distribution and ensures equal exposure in proportion to merit.
result Achieves sublinear fairness regret of O(TlnT)O(\sqrt{T\ln T}) in single pull case.

We propose directed time series regression, a new approach to estimating parameters of time-series models for use in certainty equivalent model predictive control. The approach combines merits of least squares regression and empirical optimization. Through a computational study involving a stochastic version of a well …

2012-06-26abs ↗pdf ↗

This article considers a one-parameter family of circles F_C, which has the interesting property that the null isocline of the family is the largest member of the family. This family of circles is bounded and we consider the problem of deriving an equation for the envelope of F_C. We provide one standard solution, and …

2007-03-02abs ↗pdf ↗

A feature-weighted mean shift algorithm improves clustering in high-dimensional data.

problem Clustering high-dimensional data with traditional mean shift algorithms.
method Feature-weighted mean shift algorithm.
result The algorithm outperforms conventional mean shift and preserves computational simplicity.

A new learning-to-rank approach ensures fairness for item providers in dynamic ranking systems.

problem Myopically optimizing user utility can be unfair to item providers in two-sided markets.
method A controller that integrates unbiased estimators for fairness and utility, dynamically adapting as more data becomes available.
result Empirically, the algorithm is highly practical and robust, ensuring amortized group fairness.

Paper identifies bias and strategic behavior in crowdsourced performance assessments.

problem Crowdsourced performance assessment risks personal interest introducing distortions.
method Developed a method to identify bias and strategic behavior using a rich dataset.
result Discovers a pattern of 'discriminatory generosity' in peer evaluation.

Statistical learning improves reactive power control in distribution systems.

problem Challenges in reactive power control due to renewable energy sources and flexible loads.
method A deep neural network parameterizes the input-output relationship between grid states and optimal reactive power control. Unknown weights are learned offline to minimize power loss, and inference is fast with matrix-vector multiplications.
result Computational efficiency and robustness to random input perturbations demonstrated in a 47-bus distribution network.

We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-comp…

2009-10-30abs ↗pdf ↗

We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell's approachability theorem to carefully chosen vector-valued payoff function and …

2009-12-18abs ↗pdf ↗

This paper proposes an ensemble of Gaussian processes for Bayesian optimization.

problem Optimizing expensive black-box functions with limited evaluations.
method An ensemble of Gaussian processes (EGP) for adaptive surrogate modeling, combined with Thompson sampling (TS) for function sampling.
result The proposed EGP-TS method achieves better optimization results than single-GP approaches.

We introduce a family of adaptive estimators on graphs, based on penalizing the 1\ell_1 norm of discrete graph differences. This generalizes the idea of trend filtering [Kim et al. (2009), Tibshirani (2014)], used for univariate nonparametric regression, to graphs. Analogous to the univariate case, graph trend filteri…

2014-10-28abs ↗pdf ↗

We propose a new framework for how to use sequential Monte Carlo (SMC) algorithms for inference in probabilistic graphical models (PGM). Via a sequential decomposition of the PGM we find a sequence of auxiliary distributions defined on a monotonically increasing sequence of probability spaces. By targeting these auxili…

2014-02-03abs ↗pdf ↗

The paper models intraday power prices using fundamental drivers.

problem Lack of research on drivers for intraday price processes.
method Modelling location, shape, and scale of intraday price distribution using fundamental variables.
result Significant improvements in probabilistic forecasting performance, especially in tails.

The study revisits portfolio diversification by relaxing assumptions for skewed, multi-regime, and leptokurtic asset returns.

problem Underestimation of risk in portfolio diversification due to assumptions that are inconsistent with real-world asset returns.
method Calibrated a Markov-modulated Levy process model to equity market data to demonstrate the merits of the approach.
result The calibrated models effectively match empirical moments and show the importance of relaxing assumptions in portfolio diversification.

Previous work on recommender systems mainly focus on fitting the ratings provided by users. However, the response patterns, i.e., some items are rated while others not, are generally ignored. We argue that failing to observe such response patterns can lead to biased parameter estimation and sub-optimal model performanc…

2012-10-16abs ↗pdf ↗

We consider the class of convex minimization problems, composed of a self-concordant function, such as the logdet\log\det metric, a convex data fidelity term h()h(\cdot) and, a regularizing -- possibly non-smooth -- function g()g(\cdot). This type of problems have recently attracted a great deal of interest, mainly due to th…

2014-05-13abs ↗pdf ↗

This paper proposes a new method for estimating sparse precision matrices in the high dimensional setting. It has been popular to study fast computation and adaptive procedures for this problem. We propose a novel approach, called Sparse Column-wise Inverse Operator, to address these two issues. We analyze an adaptive …

2012-03-17abs ↗pdf ↗

The study identifies influential bioinformatics algorithms for scalable computing.

problem Data deluge in bioinformatics and need for scalable computing solutions.
method Identifying and analyzing influential data mining and machine learning algorithms.
result Guiding scalable computing experts to focus on specific bioinformatics algorithms.

The study improves VaR forecast accuracy by modeling conditional quantile dynamics.

problem Improving the accuracy of Value-at-Risk (VaR) forecasts for time-varying quantiles.
method Time-varying modeling of VaR, evaluation via simulation, asymmetric Mean Absolute Deviation loss function.
result Substantial improvements in forecasting conditional quantiles by maintaining predicted quantile unchanged.

Investigates projections onto explicit subspaces and their variance effects.

problem Understanding the variance preservation in explicit subspace projections.
method Investigates projections onto explicit subspaces of varying dimensionality and analyzes the variance effects.
result Developed new bounds for Euclidean distances and inner products.

This paper aims at achieving a simultaneously sparse and low-rank estimator from the semidefinite population covariance matrices. We first benefit from a convex optimization which develops l1l_1-norm penalty to encourage the sparsity and nuclear norm to favor the low-rank property. For the proposed estimator, we then p…

2014-07-17abs ↗pdf ↗