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

Trend · papers per month

123245368490 · Jun 202019922001200920172026
48 results for Process Discovery Contest 2019

DisCoveR efficiently discovers declarative process models from event logs.

problem Mining declarative process models from event logs efficiently and accurately.
method DisCoveR precisely formalizes an algorithm, uses a bit vector implementation, and rigorously evaluates performance.
result DisCoveR outperforms other declarative miners in accuracy and runtime.

Proposes a method for neural networks to learn causal relationships and humans to contest and modify them.

problem Neural networks learn relevant causal relationships unclearly and are black-box, making them hard to debug.
method Two-way interaction between neural networks and humans, allowing contestation and modification of causal graphs.
result Improves predictive performance up to 2.4x and produces smaller networks up to 7x compared to SOTA.

This paper discusses the gambling contest introduced in Seel & Strack (Gambling in contests, Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 375, Mar 2012.) and considers the impact of adding a penalty associated with failure to follow a winning strategy. The Seel & Strack model c…

2013-01-04abs ↗pdf ↗

We introduce a new molecular dataset, named Alchemy, for developing machine learning models useful in chemistry and material science. As of June 20th 2019, the dataset comprises of 12 quantum mechanical properties of 119,487 organic molecules with up to 14 heavy atoms, sampled from the GDB MedChem database. The Alchemy…

2019-06-22abs ↗pdf ↗

Top 8 robotic vision systems tackled lifelong object recognition challenges.

problem Lifelong learning in robotic vision for varied, dynamic environments.
method Design of a dataset with diverse conditions and rules for evaluation.
result Robotic vision systems improved over time with dynamic object appearances.

New framework for contesting algorithmic decisions, not just explaining them.

problem Helping individuals review and correct erroneous algorithmic decisions.
method Operationalized contestability as a natural complement to explainable AI (XAI), identifying three types of evidence for reversal.
result Existing EU legislation already grants individuals legal rights to contest algorithmic decisions.

Study optimal reward schemes for inducing desired player performance in risky contests.

problem Designing optimal rewards to encourage desired performance levels in risky contests.
method Analyzed the optimal reward schemes for inducing average and specific rank performance.
result Optimal reward schemes can have surprising shapes, not just related to inequality.

We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achi…

2018-09-22abs ↗pdf ↗

Paper improves financial trading models using GPU parallelism.

problem Challenges in policy instability and sampling bottlenecks in reinforcement learning for financial tasks.
method Revisits ensemble methods with massively parallel simulations on GPUs.
result Significantly improved computational efficiency and robustness of financial decision-making strategies.

In matrix factorization, available graph side-information may not be well suited for the matrix completion problem, having edges that disagree with the latent-feature relations learnt from the incomplete data matrix. We show that removing these contested\textit{contested} edges improves prediction accuracy and scalability. We…

2019-08-25abs ↗pdf ↗

The aim of process discovery, originating from the area of process mining, is to discover a process model based on business process execution data. A majority of process discovery techniques relies on an event log as an input. An event log is a static source of historical data capturing the execution of a business proc…

2017-04-25abs ↗pdf ↗

Automated process discovery is a class of process mining methods that allow analysts to extract business process models from event logs. Traditional process discovery methods extract process models from a snapshot of an event log stored in its entirety. In some scenarios, however, events keep coming with a high arrival…

2018-04-08abs ↗pdf ↗

Agent learns diverse hierarchical structures in unknown environments.

problem Autonomous discovery and learning of diverse structures in unknown changing environments.
method Progressive construction of a Hierarchy of Observation Latent Models for Exploration Stratification (HOLMES).
result Agent can learn and reuse representations to progressively explore and discover diverse structures.

CausalRivers benchmarks causal discovery methods on real-world river discharge data.

problem Lack of in-the-wild evaluation of causal discovery methods on complex, real-world data.
method Introduces CausalRivers, a large-scale dataset of river discharge data for benchmarking.
result Demonstrates the utility of CausalRivers in evaluating causal discovery methods.

Process discovery has seen a rise in popularity in the last decade for both researchers and businesses. Recent developments mainly focused on the power and the functionalities of the discovery algorithm. While continuous improvement of these functional aspects is very important, non-functional aspects such as visualiza…

2018-08-13abs ↗pdf ↗

Study optimizes trading strategies in markets with transaction costs and uncertain models.

problem Optimizing trading strategies in markets with transaction costs and model uncertainty.
method Maximizing worst-case expected utility over a class of models on a filtered probability space.
result Existence of optimal trading strategies for general càdlàg price processes and incomplete filtrations.

The paper examines how timing of observations affects causal discovery methods.

problem The sensitivity of causal discovery methods to mismatched observation timing.
method Empirical and theoretical analysis of classical and recent causal discovery methods.
result Causal discovery methods are sensitive to sampling rate and window length.

NLP techniques improve drug discovery by analyzing chemical and protein text.

problem Improving drug discovery through better analysis of chemical and protein text.
method Natural language processing techniques applied to biochemical entities.
result Enhanced prediction of molecular properties and design of novel molecules.

Recently, sentiment analysis has received a lot of attention due to the interest in mining opinions of social media users. Sentiment analysis consists in determining the polarity of a given text, i.e., its degree of positiveness or negativeness. Traditionally, Sentiment Analysis algorithms have been tailored to a speci…

2016-12-15abs ↗pdf ↗

A new method distills material models from noisy data without prior selection.

problem Uncertainty in material model discovery from noisy data.
method Augmenting data with Gaussian process, approximating parameter distribution with normalizing flow, distilling by matching stress-deformation functions, performing sensitivity analysis.
result Sparse and interpretable material models discovered from experimental data.

RAMBO optimizes multi-regime problems by discovering and modeling distinct energy basins.

problem Multi-regime problems in molecular conformation and drug discovery.
method Dirichlet Process Mixture of Gaussian Processes with adaptive hyperparameters and concentration parameters.
result Consistent improvements over state-of-the-art on multi-regime objectives.

New method uncovers hidden causal connections in multivariate point process networks.

problem Unobserved hidden variables confound causal discovery in high-dimensional point process networks.
method Proposes a deconfounding procedure to estimate causal interactions among observed nodes with unknown unobserved processes.
result The method accurately identifies causal interactions among observed processes, even with hidden variables.

We propose an alternative framework to existing setups for controlling false alarms when multiple A/B tests are run over time. This setup arises in many practical applications, e.g. when pharmaceutical companies test new treatment options against control pills for different diseases, or when internet companies test the…

2017-06-16abs ↗pdf ↗

NeurIPS 2019 program improves reproducibility in machine learning.

problem Ensuring machine learning research results are reproducible and reliable.
method Code submission policy, reproducibility challenge, and checklist integration.
result Improved reproducibility standards across the machine learning community.

GPR enhances materials discovery by automating parameter space exploration.

problem Automating exploration of large, high-dimensional parameter spaces in materials science.
method Gaussian process regression with inhomogeneous measurement noise and anisotropic kernels.
result Importance and benefits of tuning GPR for materials science experiments.

Interpretable framework evaluates structure learning methods for causal discovery from observational data.

problem Evaluation of structure learning methods under assumption violations in causal discovery.
method Six-dimensional evaluation metric (DOS) tailored for causal discovery.
result Amortized causal discovery delivers results with high proximity to the optimal solution.

Existing methods for structure discovery in time series data construct interpretable, compositional kernels for Gaussian process regression models. While the learned Gaussian process model provides posterior mean and variance estimates, typically the structure is learned via a greedy optimization procedure. This restri…

2016-11-21abs ↗pdf ↗

Unified kernel-based methods improve nonlinear causal discovery.

problem Identifying nonlinear causal relationships between time series variables.
method Unified Kernel Principal Component Regression (KPCR) and Gaussian Process score-based model with Smooth Information Criterion.
result Improved performance in time series nonlinear causal discovery.

Bayesian model selection improves multivariate causal discovery without restrictive assumptions.

problem Real-world causal discovery requires flexible assumptions to avoid restrictive model assumptions.
method Continuous relaxation of discrete model selection problem, using Causal Gaussian Process Conditional Density Estimator (CGP-CDE).
result Bayesian approach outperforms traditional methods in multivariate causal discovery.

Generates synthetic manufacturing data for causal discovery benchmarking.

problem Lack of suitable real data for validating causal discovery algorithms.
method Distributional random forests for estimating conditional distributions.
result Semisynthetic manufacturing data adheres to a causal model.

The study analyzes games and social hierarchies, incorporating luck and depth of competition.

problem Analyzing patterns of wins and losses in games and social hierarchies.
method Generalized probabilistic models incorporating luck and depth of competition.
result Social competition tends to be deeper with many distinct levels, but there is often a chance of upset victories.