We present ease.ml, a declarative machine learning service platform we built to support more than ten research groups outside the computer science departments at ETH Zurich for their machine learning needs. With ease.ml, a user defines the high-level schema of a machine learning application and submits the task via a W…
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,051 papers · 148 categories
Trend · papers per month
48 results for “ease of use”
EASE optimizes exemplar selection for ICL in LLMs efficiently.
problem Efficiently selecting exemplars for in-context learning (ICL) in large language models (LLMs).
method EASE uses neural bandit algorithms to optimize exemplar sets, considering both exemplar ordering and instruction.
result EASE outperforms existing methods in finding optimal exemplar sets for all test queries.
System detects overfitting in ML apps, improving quality and efficiency.
problem Overfitting in ML applications during continuous development.
method ease. ml/meter system for automated overfitting detection and measurement.
result Probabilistic overfitting signals for developers to take actions.
In agreement with the recent research findings in the econophysics, we propose that the nonlinear dynamic chaos can be generated by the turbulent capital flows in both the quantitative easing transmission channels and the transaction networks channels, when there are the laminar turbulent capital flows transitions in t…
ease.ml/ci integrates machine learning models rigorously with minimal labeling effort.
problem Lack of rigorous continuous integration for machine learning models.
method Design of a domain-specific language and novel optimizations to reduce labeling effort.
result Achieved single accuracy point error tolerance with 0.999 reliability using minimal labeling effort.
Quantitative easing is an incomplete strategy that must be accompanied by the nullification of debtq-fin.GN
Compound interest as well as inflation grows exponentially with time, whereas other means to repay debt grow polynomially. For this and other, mostly political, reasons, debt without inflation is unsustainable. We suggest a discontinuous way to eliminate debt by nullifying it. This scenario is preferable to current cen…
Study creates a global living index to assess quality of life.
problem Long-term impacts of global economic changes on living conditions.
method Machine learning framework combining socio-economic factors.
result Developed a practical tool for policymakers to identify areas needing improvement.
We consider the linear regression problem under semi-supervised settings wherein the available data typically consists of: (i) a small or moderate sized 'labeled' data, and (ii) a much larger sized 'unlabeled' data. Such data arises naturally from settings where the outcome, unlike the covariates, is expensive to obtai…
Pymc-learn simplifies probabilistic machine learning for non-specialists.
problem Making probabilistic machine learning accessible to non-experts.
method Inspired by scikit-learn, Pymc-learn provides a high-level language for probabilistic models.
result Pymc-learn brings probabilistic machine learning to non-specialists with ease, performance, and flexibility.
EASE estimator improves probabilistic value estimation efficiency.
problem Efficiently estimating probabilistic values like Shapley and semivalues.
method Developed an Efficiency-Aware Surrogate-adjusted Estimator (EASE) that minimizes first-order mean squared error.
result EASE consistently outperforms existing estimators for various probabilistic values.
BlackJAX simplifies Bayesian inference with modular, fast implementations.
problem Efficient and modular Bayesian inference methods for complex models.
method Functional approach to implementing sampling and variational inference algorithms in JAX.
result Ease of use, speed, and modularity in implementing Bayesian inference.
A toolkit for path-norms enhances neural network generalization bounds.
problem Establishing generalization bounds for modern neural networks.
method Introducing a comprehensive toolkit for path-norms in ReLU networks with various operations.
result Established generalization bounds for modern neural networks that are the most widely applicable and recover/beat the sharpest known bounds.
Meta-learning balances task-specific modeling and optimization complexity.
problem Balancing accurate task-specific modeling with ease of optimization in meta-learning.
method Theoretical and empirical analysis of trade-off between modeling and optimization in meta-learning.
result Explicit bounds on modeling and optimization errors for non-convex and linear regression problems.
Skewing Quanto with Simplicityq-fin.MF
Simple method solves Quanto Skew problem.
problem Quanto Skew problem in Equities and FX.
method Analytical method that accommodates Equity and FX volatility skew.
result Highly efficient and fast performance.
Introduces TDRC to balance TD's ease and soundness.
problem TD learning's instability and divergence issues.
method Gradient Temporal-Difference Learning with Regularized Corrections (TDRC).
result TDRC performs as well as TD when TD works, but is sound in divergent cases.
Graph neural network predicts JavaScript types with high accuracy.
problem Automatic code repair for JavaScript programs.
method Graph Neural Network model for token type prediction.
result Achieved above 90% accuracy in token type predictions.
CogDL simplifies graph deep learning experiments and benchmarks.
problem Challenges in training and evaluating graph neural networks.
method Unified design for training and evaluation, mixed precision training, efficient sparse operators, ease of use.
result CogDL is the most competitive graph library for efficiency and ease of use.
High predictive performance and ease of use and interpretability are important requirements for the applicability of a computer-aided diagnosis (CAD) to human reading studies. We propose a CAD system specifically designed to be more comprehensible to the radiologist reviewing screening breast MRI studies. Multiparametr…
Diffusion Maps meet Nyströmstat.ML
Diffusion maps are an emerging data-driven technique for non-linear dimensionality reduction, which are especially useful for the analysis of coherent structures and nonlinear embeddings of dynamical systems. However, the computational complexity of the diffusion maps algorithm scales with the number of observations. T…
We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric app…
Linear models like EASE and SLIM are competitive in recommendation, and this work explores their theoretical relationship.
problem Understanding the relationship between linear models and matrix factorization in recommendation systems.
method Derivation and analysis of closed-form solutions for regression and matrix factorization approaches.
result Linear models and matrix factorization approaches are related but diverge in scaling singular values.
Over the last several years, the use of machine learning (ML) in neuroscience has been rapidly increasing. Here, we review ML's contributions, both realized and potential, across several areas of systems neuroscience. We describe four primary roles of ML within neuroscience: 1) creating solutions to engineering problem…
Simplifies F-measure for better interpretability.
problem Lack of intuitive interpretation of F-measure.
method Introduces F* (F-star) transformation.
result F* provides an immediate practical interpretation.
In this paper I develop a new computational method for pricing path dependent options. Using the path integral representation of the option price, I show that in general it is possible to perform analytically a partial averaging over the underlying risk-neutral diffusion process. This result greatly eases the computati…
This paper studies how to capture dependency graph structures from real data which may not be Gaussian. Starting from marginal loss functions not necessarily derived from probability distributions, we utilize an additive over-parametrization with shrinkage to incorporate variable dependencies into the criterion. An ite…
Gradient descent optimization improved by circuit perspective.
problem Efficient training of large AI systems.
method Utilizing circuit perspective for mechanistic interpretability.
result Designing a curriculum for efficient learning.
InferPy simplifies probabilistic modeling with deep neural networks in Python.
problem Complex probabilistic models with deep neural networks.
method User-friendly API for defining, learning, and evaluating models.
result Compact and simple way to define general hierarchical probabilistic models.
The classification of complex data usually requires the composition of processing steps. Here, a major challenge is the selection of optimal algorithms for preprocessing and classification (including parameterizations). Nowadays, parts of the optimization process are automized but expert knowledge and manual work are s…
Characterizes diagrams achieving Morton-Franks-Williams inequality for positive knots and links.
problem Understanding when the Morton-Franks-Williams inequality holds for positive knots and links.
method Combinatorial characterisation and generating examples.
result Examples of diagrams achieving crossing number, braid index, and maximal self-linking number.
New metric improves topic model evaluation.
problem Lack of standard cross-contextual evaluation metrics for topic modeling.
method Introduces as a coefficient of determination for topic models.
result Improves topic model evaluation by providing a standard metric.
We give a detailed account of correlations between credit sector/quality and treasury curve factors, using the robust framework of the Barclays POINT Global Risk Model. Consistent with earlier studies, we find a strong negative correlation between sector spreads and rate shifts. However, we also observe that the correl…
The Generative Adversarial Network (GAN) has achieved great success in generating realistic (real-valued) synthetic data. However, convergence issues and difficulties dealing with discrete data hinder the applicability of GAN to text. We propose a framework for generating realistic text via adversarial training. We emp…
We compute the transition probability between two learning tasks, and show that it decomposes into two factors. The first depends on the geometry of the loss landscape of a model trained on each task, independent of any particular model used. This is related to an information theoretic distance function, but is insuffi…
We propose a simple technique for encouraging generative RNNs to plan ahead. We train a "backward" recurrent network to generate a given sequence in reverse order, and we encourage states of the forward model to predict cotemporal states of the backward model. The backward network is used only during training, and play…
BARMPy offers a Python package for Bayesian Additive Regression Models.
problem Making complex Bayesian models accessible to machine learning practitioners.
method Object-oriented design compatible with SciKit-Learn, documentation and tutorial provided.
result Ease of use and compatibility with existing machine learning tools.
Noether's First Theorem yields conservation laws for Lagrangians with a variational symmetry group. The explicit formulae for the laws are well known and the symmetry group is known to act on the linear space generated by the conservation laws. In recent work the authors showed the mathematical structure behind both th…
stCEG models spatial events using Chain Event Graphs in R.
problem Modeling events over spatial areas.
method Full specification of CEG models from data, interactive plots, web GUI.
result First software for CEGs with full model customisation.
modAL is a modular active learning framework for Python, aimed to make active learning research and practice simpler. Its distinguishing features are (i) clear and modular object oriented design (ii) full compatibility with scikit-learn models and workflows. These features make fast prototyping and easy extensibility p…
This paper introduces a general Bayesian non- parametric latent feature model suitable to per- form automatic exploratory analysis of heterogeneous datasets, where the attributes describing each object can be either discrete, continuous or mixed variables. The proposed model presents several important properties. First…
mvlearn simplifies multiview machine learning for non-specialists.
problem Handling multiview data sets from disparate sources.
method Python library implementing multiview machine learning methods.
result Enables non-specialists to use multiview machine learning methods easily.
This paper simplifies the Nash Bargaining Solution for use in intellectual property cases.
problem Limited application of Nash Bargaining Solution in assigning intellectual property damages.
method Normalizes the Nash Bargaining Solution and provides a methodology for determining bargaining weight.
result Clarifies the application of Nash Bargaining Solution to specific case facts.
Reinforcement learning has gained wide popularity as a technique for simulation-driven approximate dynamic programming. A less known aspect is that the very reasons that make it effective in dynamic programming can also be leveraged for using it for distributed schemes for certain matrix computations involving non-nega…
Auto-Surprise automates recommender system selection and optimization.
problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.
Simultaneously recorded electroencephalography (EEG) and functional magnetic resonance imaging (fMRI) can be used to non-invasively measure the spatiotemporal dynamics of the human brain. One challenge is dealing with the artifacts that each modality introduces into the other when the two are recorded concurrently, for…
Proposes active sampling for improving fairness in machine learning.
problem Improving fairness in machine learning models, especially for disadvantaged groups.
method Simple active sampling and reweighting strategies for min-max fairness.
result Proves the rate of convergence to a min-max fair solution for convex problems.
Disentangled representations, where the higher level data generative factors are reflected in disjoint latent dimensions, offer several benefits such as ease of deriving invariant representations, transferability to other tasks, interpretability, etc. We consider the problem of unsupervised learning of disentangled rep…
Stable Neural Flowscs.LG
Stable neural flows ensure robustness and efficiency in deep learning.
problem Ensuring robustness and stability in deep learning models.
method Introducing a stable variant of neural ODEs with a neural network parametrizing an energy functional, solving as an optimal control problem with adjoint sensitivity analysis.
result The proposed model provides robustness against input perturbations and low computational burden.
ALT transforms time series data for better classification.
problem Efficiently classifying time series data with varying temporal scales.
method ALT algorithm using variable-length shifted time windows.
result State-of-the-art performance with minimal computational overhead.