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

Trend · papers per month

217435652869 · Jun 202019922001200920172026
48 results for relevance optimization

SADCBO optimizes contextual variables by balancing relevance and cost.

problem Optimizing contextual variables with varying costs and unknown relevance.
method Adaptive selection of relevant contextual variables using sensitivity analysis and early stopping.
result Consistent improvement in optimization across various examples.

The relevance of data quantifies learning efficiency.

problem Understanding the statistical nature of high-dimensional, sparse data.
method Defining relevance as information content, and using it to define ideal limits of samples and learning machines.
result Maximally informative samples and optimal learning machines exhibit critical features like power-law frequency distributions and anomalously large susceptibility.

Adequate evaluation of an information retrieval system to estimate future performance is a crucial task. Area under the ROC curve (AUC) is widely used to evaluate the generalization of a retrieval system. However, the objective function optimized in many retrieval systems is the error rate and not the AUC value. This p…

2015-11-16abs ↗pdf ↗

We design an optimal strategy for investment in a portfolio of assets subject to a multiplicative Brownian motion. The strategy provides the maximal typical long-term growth rate of investor's capital. We determine the optimal fraction of capital that an investor should keep in risky assets as well as weights of differ…

1998-01-23abs ↗pdf ↗

DMNL bandits optimize assortment choices balancing relevance and diversity.

problem Balancing relevance-driven choice with within-assortment diversity.
method Augments MNL choice probabilities with a submodular diversity function, proposing a white-box UCB-based algorithm.
result Achieves at least a (11e+1)(1-\frac{1}{e+1})-approximate regret bound of $ ilde{O}\left(d \sqrt{T/K} ight)$.

New approach quantifies overfitting in high-dimensional regression.

problem Quantifying and avoiding overfitting in large neural networks.
method Information bottleneck theory to minimize residual information while maximizing relevant bits.
result Characterized the relative information efficiency of randomized regression compared to optimal algorithms.

PRI-VAE learns disentangled representations by optimizing principle-of-relevant-information.

problem Learning disentangled representations under VAE framework remains unknown.
method Proposes PRI-VAE, a novel learning objective to optimize disentanglement.
result Demonstrates effectiveness of PRI-VAE on four benchmark datasets.

A new algorithm removes stale observations in dynamic Bayesian optimization.

problem Optimizing functions that change over time, keeping track of the optimum.
method Wasserstein distance-based criterion to quantify relevancy, removing stale observations.
result W-DBO maintains good predictive performance and high sampling frequency.

RFFNet scales kernel methods to large datasets by learning kernel relevance.

problem Scaling kernel methods to large datasets while maintaining interpretability.
method Designs random Fourier features for ARD kernels and uses first-order stochastic optimization for learning kernel relevances.
result RFFNet achieves low prediction error and identifies relevant features, leading to more interpretable solutions.

We propose a method for finding alternate features missing in the Lasso optimal solution. In ordinary Lasso problem, one global optimum is obtained and the resulting features are interpreted as task-relevant features. However, this can overlook possibly relevant features not selected by the Lasso. With the proposed met…

2016-11-18abs ↗pdf ↗

The problem of distributed representation learning is one in which multiple sources of information X1,,XKX_1,\ldots,X_K are processed separately so as to learn as much information as possible about some ground truth YY. We investigate this problem from information-theoretic grounds, through a generalization of Tishby's ce…

2018-07-11abs ↗pdf ↗

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural optimization and stochastic optimization. Our presentation of black-box optimizati…

2014-05-20abs ↗pdf ↗

Jointly learns feature and sample relevancies for robust sparse recovery.

problem Sparse recovery sensitivity to data contaminants like outliers or misspecified noise.
method Jointly learns feature and sample relevancies via marginal likelihood optimization.
result Consistent sparse and robust prediction models across diverse tasks.

E-Commerce (E-Com) search is an emerging important new application of information retrieval. Learning to Rank (LETOR) is a general effective strategy for optimizing search engines, and is thus also a key technology for E-Com search. While the use of LETOR for web search has been well studied, its use for E-Com search h…

2019-03-01abs ↗pdf ↗

In this work, we provide a framework linking microstructural properties of an asset to the tick value of the exchange. In particular, we bring to light a quantity, referred to as implicit spread, playing the role of spread for large tick assets, for which the effective spread is almost always equal to one tick. The rel…

2012-07-26abs ↗pdf ↗

We analyze different re-ranking algorithms for diversification and show that majority of them are based on maximizing submodular/modular functions from the class of parameterized concave/linear over modular functions. We study the optimality of such algorithms in terms of the `total curvature'. We also show that by adj…

2019-06-26abs ↗pdf ↗

Proposes UICR to improve novelty in recommendation systems without sacrificing relevance.

problem Balancing relevance and novelty in recommendation systems is challenging, especially for long-tail items.
method Introduces uncertainty modeling in the matching stage and multi-task modeling of model and index uncertainty.
result Improves novelty without sacrificing relevance, as shown by experimental results and online A/B tests.

A new jump diffusion regime-switching model is introduced, which allows for linking jumps in asset prices with regime changes. We prove the existence and uniqueness of the solution to the risk-sensitive asset management criterion maximisation problem in this setting. We provide an ODE for the optimal value function, wh…

2014-07-20abs ↗pdf ↗

New framework improves worst-case generalization bounds for stochastic optimization.

problem Challenges in providing generalization guarantees for stochastic optimization algorithms.
method Introduces random set stability and empirically relevant complexity measures to avoid intractable mutual information terms.
result Bounded worst-case generalization error in terms of random set stability and empirically relevant complexity measures.

Novel metrics improve machine learning models for ICU patient care.

problem Predicting vital sign trajectories for early detection of adverse events.
method Developed novel performance metrics aligned with clinical contexts, validated on simulated and real datasets, and optimized neural networks using these metrics.
result Neural networks trained with these metrics excel in predicting clinically significant events.

The muti-layer information bottleneck (IB) problem, where information is propagated (or successively refined) from layer to layer, is considered. Based on information forwarded by the preceding layer, each stage of the network is required to preserve a certain level of relevance with regards to a specific hidden variab…

2017-11-14abs ↗pdf ↗

BONSAI optimizes parameters while respecting a default configuration, reducing unnecessary changes.

problem Standard BO pushes weakly relevant parameters to the boundary, making it hard to distinguish between important and spurious changes.
method BONSAI is a default-aware BO policy that prunes low-impact deviations from a default configuration while controlling acquisition value loss.
result BONSAI matches the GP-UCB regret rate while recovering the minimal-0\ell_0 solution, reducing the number of non-default parameters in recommended configurations.

An unsupervised anomaly detection method for irregularly sampled time-series data.

problem Anomaly detection in irregularly sampled or missing valued time-series data.
method Uses LSTM networks with time modulation gates to extract temporal features and SVDD for anomaly labeling.
result Significantly outperforms standard approaches on real-life datasets.

Many sequential decision-making tasks require choosing at each decision step the right action out of the vast set of possibilities by extracting actionable intelligence from high-dimensional data streams. Most of the times, the high-dimensionality of actions and data makes learning of the optimal actions by traditional…

2019-07-01abs ↗pdf ↗

Feature selection has been proven a powerful preprocessing step for high-dimensional data analysis. However, most state-of-the-art methods tend to overlook the structural correlation information between pairwise samples, which may encapsulate useful information for refining the performance of feature selection. Moreove…

2019-02-26abs ↗pdf ↗

Data coarse graining improves model performance by filtering out less relevant features.

problem Lossy data transformations lose information but can improve model generalization.
method Data coarse graining schemes that systematically discard features based on relevance to the learning task.
result A 'high-pass' scheme helps models generalize better by filtering out less relevant features.

The paper debiases mini-batch approximations in deep learning for more accurate optimization and uncertainty quantification.

problem Bias in mini-batch approximations distorts the shape of quadratic approximations used in deep learning.
method Developed and evaluated debiasing strategies for mini-batch approximations.
result Debiasing strategies improve the accuracy of second-order optimization and uncertainty quantification in deep learning.

PAMA learns covariate importance for better matching in observational studies.

problem Poor performance of conventional matching methods when covariates differ in relevance.
method PAMA is a semi-supervised framework that learns covariate importance from paired data and optimizes a weighted quadratic score.
result PAMA outperforms standard methods, particularly in high-dimensional settings and under model misspecification.

A new method optimizes recommender systems by addressing missing-not-at-random implicit feedback.

problem Missing-not-at-random implicit feedback in recommender systems.
method Defining an ideal loss function and proposing an unbiased estimator to optimize relevance.
result The proposed method improves performance, especially for rare items.

RID framework quantifies and regularizes task-relevant knowledge in distillation.

problem Distilling irrelevant information can hinder student model performance.
method Partial Information Decomposition to quantify and regularize task-relevant knowledge.
result RID framework leads to more resilient distillation under nuisance teachers.

XGBoost fails to accurately identify relevant features, while interpretable methods do.

problem Accurately identifying relevant features in black-box models like XGBoost.
method Comparison of variable importance methods (CART, Optimal Trees, XGBoost, SHAP) across various experiments.
result Interpretable methods outperform black-box models in feature selection accuracy.

Improved time complexity for parallel stochastic optimization in heterogeneous systems.

problem Time complexity in parallel stochastic optimization for large-scale machine learning models.
method Proposes Rennala MVR, a variance-reduced extension of Rennala SGD based on momentum-based variance reduction.
result Variance reduction improves time complexity in relevant parameter regimes for parallel stochastic optimization in heterogeneous systems.

Since the events of the Arab Spring, there has been increased interest in using social media to anticipate social unrest. While efforts have been made toward automated unrest prediction, we focus on filtering the vast volume of tweets to identify tweets relevant to unrest, which can be provided to downstream users for …

2017-02-20abs ↗pdf ↗