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

3857711,1561,541 · Jun 202019922001200920172026
48 results for skeptical learning

The paper tackles multi-label ranking with uncertain probabilities.

problem Making skeptical inferences for multi-label ranking with sets of probabilities.
method Assumes a convex set of probabilities (credal set) over labels and seeks set-valued predictions.
result Developed methods for making skeptical inferences in multi-label ranking with uncertain probabilities.

Study efficient interactive learning for structured outputs with reliable computation.

problem Interactive learning with noisy labels and structured output spaces.
method Identify and utilize CRISPs (probabilistic models) that guarantee reliable and efficient computation of probabilistic quantities.
result CRISPs enable robust and efficient active and skeptical learning in large structured output spaces.

The paper tackles skeptical binary inferences in multi-label problems with sets of probabilities.

problem Making distributionally robust, skeptical inferences for multi-label problems.
method Study of distributionally robust, skeptical inferences for multi-label problems using Hamming loss.
result Skeptical inferences provide partial predictions for a sufficiently big set of probability distributions.

We propose a semiparametric approach, named nonparanormal skeptic, for estimating high dimensional undirected graphical models. In terms of modeling, we consider the nonparanormal family proposed by Liu et al (2009). In terms of estimation, we exploit nonparametric rank-based correlation coefficient estimators includin…

2012-06-27abs ↗pdf ↗

Algorithm identifies correct hypothesis from alternatives in bandit problems.

problem Efficiently identifying the correct hypothesis from a finite set of alternatives in structured stochastic multi-armed bandits.
method Frank-Wolfe Self-Play (FWSP) reformulates the game as a saddle-point problem, using a differential-inclusion argument to prove convergence.
result Convergence of the game value for best-arm identification in linear bandits, with uniform global convergence to the optimal value.

A new method for precise user targeting in advertising using hyperbolic manifold learning.

problem Improving user satisfaction in targeted advertising by overcoming skepticism and spam perception.
method Proposes a Multi-Manifold Learning framework to learn hierarchical user and ad representations in the hyperbolic space.
result Demonstrates improved performance in user targeting and prediction accuracy on both public datasets and a large-scale commercial system.

In this paper, we propose a semiparametric approach, named nonparanormal skeptic, for efficiently and robustly estimating high dimensional undirected graphical models. To achieve modeling flexibility, we consider Gaussian Copula graphical models (or the nonparanormal) as proposed by Liu et al. (2009). To achieve estima…

2012-02-10abs ↗pdf ↗

Recently deep neural networks have been successfully used for various classification tasks, especially for problems with massive perfectly labeled training data. However, it is often costly to have large-scale credible labels in real-world applications. One solution is to make supervised learning robust with imperfectl…

2018-11-09abs ↗pdf ↗

Breiman's paper sparked debate on the future of statistics and machine learning.

problem The tension between traditional statistical modeling and model-free machine learning approaches.
method Discussion of the implications of machine learning's success and the need for new inferential approaches.
result The importance of understanding 'why' and 'if' questions in machine learning is now recognized.

Social networks offer a ready channel for fake and misleading news to spread and exert influence. This paper examines the performance of different reputation algorithms when applied to a large and statistically significant portion of the news that are spread via Twitter. Our main result is that simple crowdsourcing-bas…

2019-02-10abs ↗pdf ↗

Studies of wealth inequality often assume that an observed wealth distribution reflects a system in equilibrium. This constraint is rarely tested empirically. We introduce a simple model that allows equilibrium but does not assume it. To geometric Brownian motion (GBM) we add reallocation: all individuals contribute in…

2016-05-18abs ↗pdf ↗

The aim of this paper is to get an overview of the online buyer profile, and also some key aspects in the way the online shopping is conducted. In this project we conducted a quantitative research, consisting of a questionnaire based survey. For data processing and interpretation we used SPSS statistical software and E…

2015-05-21abs ↗pdf ↗

In this paper, we try to uncover the second-order essence of several first-order optimization methods. For Nesterov Accelerated Gradient, we rigorously prove that the algorithm makes use of the difference between past and current gradients, thus approximates the Hessian and accelerates the training. For adaptive method…

2019-12-20abs ↗pdf ↗

This study explains how adversarial interaction creates non-homogeneous patterns using a pseudo-Reaction-Diffusion model.

problem Understanding how adversarial interaction leads to non-homogeneous patterns in systems.
method Developed a pseudo-Reaction-Diffusion model to explain the mechanism.
result Turing instability is involved in creating non-homogeneous patterns.

Generative model connects physical properties to latent vectors for solar magnetic patches.

problem Disconnection between generative latent vectors and scientifically relevant quantities.
method Integrating GAN, SVM, and SSL to generate and retrieve physically interpretable solar magnetic patches.
result GAN-SVM combination enables smooth changes in physical parameters with generated patches.

The paper examines how insurers manage risks and liquidity in a dynamic market.

problem Model uncertainty in insurance pricing and competitive equilibrium.
method Analyzes insurers' robustness preferences and optimization strategies for underwriting and liquidity management.
result Robust insurance pricing leads to higher premiums and equity valuations compared to a benchmark.

Corporate governance struggles to curb fraud in a globalized economy.

problem Lack of effective international regulations against corporate fraud.
method Analyzes historical economic crises and the role of corporate governance.
result Corporate governance is insufficient to prevent large business fraud.

Experiment shows cognitive biases impact human-AI collaboration, highlighting the need for diverse evaluator samples.

problem Cognitive biases affect human-AI collaboration, leading to suboptimal outcomes.
method Randomized experiment with 2,784 participants, manipulating AI suggestion quality, task burden, and financial incentives.
result Individual attitudes toward AI are the strongest predictor of performance, influencing accuracy and overcorrection.

Meta-learning improves neural networks by adapting learning algorithms.

problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.

Study Whittle index learning algorithms for restless bandits with constant stepsizes.

problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.

New unsupervised learning technique learns independent kernels for better machine learning tasks.

problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.

New self-imitation learning method improves performance in continuous control tasks.

problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.

Deep reinforcement learning finds optimal learning policies for adaptive systems.

problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.

Study batch reinforcement learning methods for personalized medical treatments.

problem Batch reinforcement learning for personalized medical treatments.
method Direct policy learning and model-based learning approaches.
result Model-based learning is impossible with finite model classes but feasible with relaxed conditions.

A new meta-meta classification method tackles few-shot learning tasks.

problem Learning with limited data in small-data settings.
method Designing an ensemble of learners for a large set of problems, then learning how to combine them for a new problem.
result Meta-meta classification outperforms traditional meta-learning and ensembling approaches in one-shot learning tasks.

Paper analyzes iterative learning for concept classes and learns half-spaces.

problem Learning concept classes efficiently with iterative learners.
method Analyzes various settings of iterative learning and provides a constructive algorithm for half-spaces.
result Constructive iterative algorithm for learning half-spaces from informant.