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

92184276368 · Jun 202019922001200920172026
48 results for diverse solutions

New method learns diverse solutions in reinforcement learning without gradient bias.

problem Lack of diverse solutions in reinforcement learning tasks.
method Maximizes state-action-based mutual information directly, using variational lower bound.
result Successfully learns an infinite set of diverse solutions.

CPRA efficiently finds diverse solutions in CO problems using UL and parallelization.

problem Finding optimal solutions often requires diverse outcomes in real-world applications.
method CPRA, an UL-based framework, discovers shared representations to generate diverse solutions.
result CPRA outperforms existing UL-based solvers in generating diverse solutions.

EDU method finds diverse optimal solutions for expensive simulators.

problem Optimizing expensive black-box simulators for diverse solutions.
method EDU method searches for diverse locally-optimal solutions within a tolerance level.
result EDU yields a closed-form acquisition function facilitating efficient sequential queries.

Proposes method to discover diverse near-optimal policies in reinforcement learning.

problem Finding different solutions to the same problem in reinforcement learning.
method Formalizes problem as CMDP, uses Successor Features, proposes new diversity rewards.
result Proposed method discovers diverse near-optimal policies that are robust and distinct.

Entropy minimization has been widely used in unsupervised domain adaptation (UDA). However, existing works reveal that entropy minimization only may result into collapsed trivial solutions. In this paper, we propose to avoid trivial solutions by further introducing diversity maximization. In order to achieve the possib…

2020-02-05abs ↗pdf ↗

A new method for diverse Pareto solutions in multi-objective learning.

problem Maximizing diversity while maximizing hypervolume in Pareto solutions.
method Annealed Stein Variational Gradient Descent (SVGD) with diverse gradient directions.
result SVH-MOL achieves superior performance in multi-objective and multi-task learning.

RL enhances LLM planning but introduces spurious solutions and diversity collapse.

problem Theoretical understanding of RL's benefits and limitations in LLM planning.
method Graph-based abstraction, policy gradient, Q-learning, supervised fine-tuning.
result RL's exploration is crucial for generalization, but PG suffers from diversity collapse.

Quality-Diversity algorithms explore multiple high-performing solutions in a search space.

problem Finding multiple high-performing solutions in complex optimization problems.
method Evolutionary computation approach focusing on behavioral space and holistic solution distribution.
result Quality-Diversity algorithms provide a comprehensive view of high-performing solutions in a search space.

BOP-Elites uses Bayesian Optimisation for QD search, improving efficiency and insight.

problem Finding diverse high-performing points from an objective function.
method Bayesian Optimisation and Gaussian Processes to model quality and diversity.
result Significantly more sample efficient and better at identifying niche solutions.

In an ordinary feature selection procedure, a set of important features is obtained by solving an optimization problem such as the Lasso regression problem, and we expect that the obtained features explain the data well. In this study, instead of the single optimal solution, we consider finding a set of diverse yet nea…

2018-10-14abs ↗pdf ↗

Transformers learn to generalize out-of-distribution with diverse pretraining tasks.

problem Conditions for pretrained transformers to generalize out-of-distribution.
method Empirical study of task diversity and pretraining distribution.
result As task diversity increases, transformers transition from specialized to generalized solutions.

UCPO improves diversity in reinforcement learning models, maintaining high accuracy.

problem RLVR objectives often lead to diversity collapse, reducing coverage of correct solutions.
method UCPO adds a conditional uniformity penalty to GRPO, redistributing probability mass.
result UCPO improves Pass@K and diversity while maintaining competitive Pass@1 accuracy.

Multi-view clustering aims at integrating complementary information from multiple heterogeneous views to improve clustering results. Existing multi-view clustering solutions can only output a single clustering of the data. Due to their multiplicity, multi-view data, can have different groupings that are reasonable and …

2019-11-26abs ↗pdf ↗

The need for diversification of recommendation lists manifests in a number of recommender systems use cases. However, an increase in diversity may undermine the utility of the recommendations, as relevant items in the list may be replaced by more diverse ones. In this work we propose a novel method for maximizing the u…

2014-11-13abs ↗pdf ↗

Developing a range-aware Bayesian optimization framework for discovering diverse designs within target property windows.

problem Discovering multiple, distinct solutions within target property windows.
method Range-aware Bayesian optimization framework.
result Consistently recovers larger and more diverse sets of valid designs.

Proposes a meta-learning method for robust portfolio optimization.

problem Optimizing a robust portfolio ensemble with diverse sub-portfolios.
method Uses a deep generative model with convolutional, LSTM, and dense layers to generate diverse sub-portfolios.
result The ensemble portfolio is robust and generalizes well, balancing performance and diversity.

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)$.

We address the problem of partial index tracking, replicating a benchmark index using a small number of assets. Accurate tracking with a sparse portfolio is extensively studied as a classic finance problem. However in practice, a tracking portfolio must also be diverse in order to minimise risk -- a requirement which h…

2018-09-06abs ↗pdf ↗

New method improves neural architecture search by optimizing for both performance and diversity.

problem Traditional multi-objective NAS fails to address practical constraints and niches.
method Formulated as quality diversity optimization, introduces multifidelity optimizers.
result Quality diversity NAS outperforms multi-objective NAS in quality and efficiency.

Hierarchical reinforcement learning (HRL) has recently shown promising advances on speeding up learning, improving the exploration, and discovering intertask transferable skills. Most recent works focus on HRL with two levels, i.e., a master policy manipulates subpolicies, which in turn manipulate primitive actions. Ho…

2018-11-10abs ↗pdf ↗

We address the challenge of effective exploration while maintaining good performance in policy gradient methods. As a solution, we propose diverse exploration (DE) via conjugate policies. DE learns and deploys a set of conjugate policies which can be conveniently generated as a byproduct of conjugate gradient descent. …

2019-02-10abs ↗pdf ↗

This study presents an ANWSER model (asset network systemic risk model) to quantify the risk of financial contagion which manifests itself in a financial crisis. The transmission of financial distress is governed by a heterogeneous bank credit network and an investment portfolio of banks. Bankruptcy reproductive ratio …

2012-11-22abs ↗pdf ↗

ePF improves PF for ITS by balancing exploration and exploitation, outperforming baselines.

problem Premature exploitation in PF leads to suboptimal solutions under constrained budgets.
method Integrates Entropic Annealing and Look-ahead Modulation to preserve diversity and evaluate potential.
result Significant improvement in task reward (up to 50% relative) on math benchmarks.

Automatic program repair holds the potential of dramatically improving the productivity of programmers during the software development process and correctness of software in general. Recent advances in machine learning, deep learning, and NLP have rekindled the hope to eventually fully automate the process of repairing…

2019-06-24abs ↗pdf ↗

A new method improves recommendation accuracy by learning from multiple networks and time-dependent user preferences.

problem Incomplete user profiles and dynamic user preferences degrade recommender quality.
method A cross-network time-aware recommender that learns from multiple source networks and develops current user models.
result The proposed solution achieves superior performance in accuracy, novelty, and diversity.

Database activity monitoring (DAM) systems are commonly used by organizations to protect the organizational data, knowledge and intellectual properties. In order to protect organizations database DAM systems have two main roles, monitoring (documenting activity) and alerting to anomalous activity. Due to high-velocity …

2019-10-23abs ↗pdf ↗

New framework for optimal transport with jumps over intermediate spaces.

problem Optimal transport with mass jumps over intermediate spaces.
method Hierarchical Jump multi-marginal transport (HJMOT) on Polish spaces.
result Existence and uniqueness of Monge solutions under sequential differentiability and twist condition.

This paper solves the multiple reference model problem in RLHF with exact solutions and sample complexity guarantees.

problem Limitations of single reference models in aligning LLMs with human feedback.
method Integrates multiple reference models into RLHF frameworks, addressing theoretical challenges with exact solutions and sample complexity guarantees.
result First exact solution to the multiple reference model problem in reverse KL-regularized RLHF.

DivDis learns diverse hypotheses from underspecified data to improve robustness.

problem Learning from underspecified datasets leads to multiple equally viable solutions, causing out-of-distribution issues.
method DivDis framework: 1) learns diverse hypotheses using unlabeled test data, 2) selects one hypothesis with minimal additional supervision.
result DivDis finds robust features in image and natural language processing problems.

MOBO-OSD optimizes multi-objective functions using orthogonal search directions.

problem Challenging multi-objective optimization problem.
method Solves multiple constrained optimization problems along orthogonal search directions.
result Consistently outperforms state-of-the-art algorithms.

GEMSS discovers multiple sparse solutions in high-dimensional data.

problem Identifying multiple sparse feature combinations in high-dimensional, underdetermined systems.
method GEMSS (Gaussian Ensemble for Multiple Sparse Solutions) uses a structured spike-and-slab prior, mixture of Gaussians, and Jaccard-based penalty to optimize a single objective function via stochastic gradient descent.
result GEMSS consistently outperforms five feature selection methods on 128 experiments and real-world datasets.

In this work, we provide an efficient and realistic data-driven approach to simulate astronomical images using deep generative models from machine learning. Our solution is based on a variant of the generative adversarial network (GAN) with progressive training methodology and Wasserstein cost function. The proposed so…

2019-09-26abs ↗pdf ↗

Standard acquisition functions are sufficient for asynchronous Bayesian optimization.

problem Redundant and repeated queries in asynchronous Bayesian optimization.
method Conceptual analysis and theoretical guarantees of standard acquisitions.
result Standard acquisition functions achieve theoretical guarantees equivalent to Thompson sampling in asynchronous settings.

This paper proposes new search algorithms for counterfactual explanations based upon mixed integer programming. We are concerned with complex data in which variables may take any value from a contiguous range or an additional set of discrete states. We propose a novel set of constraints that we refer to as a "mixed pol…

2019-01-02abs ↗pdf ↗

The instance segmentation problem intends to precisely detect and delineate objects in images. Most of the current solutions rely on deep convolutional neural networks but despite this fact proposed solutions are very diverse. Some solutions approach the problem as a network problem, where they use several networks or …

2019-02-01abs ↗pdf ↗

Machine learning (ML) needs industry-standard performance benchmarks to support design and competitive evaluation of the many emerging software and hardware solutions for ML. But ML training presents three unique benchmarking challenges absent from other domains: optimizations that improve training throughput can incre…

2019-10-02abs ↗pdf ↗