Paper improves ATN for generating adversarial examples.
problem Generating adversarial examples to fool models.
method Improves Adversarial Transformation Networks (ATN).
result Won 2nd place in CAAD 2018 non-target task.
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 “CAAD 2018”
Proceedings of the 2018 ICML Workshop on Human Interpretability in Machine Learning (WHI 2018)stat.ML
This is the Proceedings of the 2018 ICML Workshop on Human Interpretability in Machine Learning (WHI 2018), which was held in Stockholm, Sweden, July 14, 2018. Invited speakers were Barbara Engelhardt, Cynthia Rudin, Fernanda Viégas, and Martin Wattenberg.
ML4H workshop at NeurIPS 2018 focuses on health applications of machine learning.
problem Improving health outcomes through machine learning.
method Presented health applications and machine learning techniques.
result Demonstrated the potential of machine learning in healthcare.
Workshop on ML for developing countries to enhance sustainability.
problem Addressing challenges in machine learning for developing nations.
method Discussion and collaboration among researchers.
result Promoting sustainable impact through machine learning.
New method improves fairness in machine learning models.
problem Reducing bias in machine learning classification models.
method Formulated as multi-objective optimization, uses gradient descent-ascent algorithm with modified gradient update step.
result Empirical tests show improved fairness compared to state-of-the-art algorithms.
The NIPS 2018 Adversarial Vision Challenge is a competition to facilitate measurable progress towards robust machine vision models and more generally applicable adversarial attacks. This document is an updated version of our competition proposal that was accepted in the competition track of 32nd Conference on Neural In…
Neural networks are known to be vulnerable to adversarial examples. In this note, we evaluate the two white-box defenses that appeared at CVPR 2018 and find they are ineffective: when applying existing techniques, we can reduce the accuracy of the defended models to 0%.
This paper reports the method and evaluation results of MedAusbild team for ISIC challenge task. Since early 2017, our team has worked on melanoma classification [1][6], and has employed deep learning since beginning of 2018 [7]. Deep learning helps researchers absolutely to treat and detect diseases by analyzing medic…
ARIMA and LSTM models predict stock prices with varying accuracy.
problem Predicting stock prices accurately.
method ARIMA and LSTM models trained on historical stock data.
result LSTM model performs better in predicting stock price changes.
FOLKLORE algorithm speeds up online multiclass logistic regression.
problem Efficiently solving online multiclass logistic regression without high computational cost.
method Developed FOLKLORE algorithm with improved runtime and regret bound.
result First practical algorithm for online multiclass logistic regression.
Improved performance in classifying domestic activities.
problem Classifying domestic activities effectively.
method Ensemble learning system based on CNN and LSTM.
result Significant improvement in F1-score (92.19% vs baseline 84.49%).
Bayesian approach models policy distribution for faster exploration and transfer learning.
problem Challenges in exploration and adaptation to new tasks in transfer learning.
method Modeling a distribution over policies in a Bayesian deep reinforcement learning setup.
result Favorable experimental results on GridWorld and MiniGrid environments.
Deep reinforcement learning improves forex trading by handling complex, random processes.
problem Stable trends in deep learning predictions for forex trading.
method Used reinforcement learning, optimized Sure-Fire policy, encoded price data, compared DQN and PPO.
result Models achieved favorable investment performance, validating reinforcement learning feasibility.
Fast generalization error bound of deep learning without scale invariance of activation functionsstat.ML
Paper derives a fast learning rate for deep neural networks without scale invariant activation functions.
problem Analyzing the impact of non-scale invariant activation functions on deep learning performance.
method Using Suzuki (2018) framework, derived a tight generalization error bound for deep neural networks with non-scale invariant activations.
result Without scale invariance of activation functions, deep learning can still achieve a fast learning rate.
Improved path-length regret bounds for adaptive and oblivious adversaries.
problem Adaptive and oblivious adversaries in multi-armed bandit and linear bandit problems.
method Developed two new algorithms based on optimistic mirror descent framework with novel techniques.
result Strictly improved path-length bounds for adaptive adversary and better results for oblivious adversary.
Linear interpolation gives better gradients than Gaussian smoothing in derivative-free optimizationmath.OC
New interpolation methods outperform Gaussian smoothing in derivative-free optimization.
problem Optimizing functions with noisy evaluations and no derivative information.
method First-order line search methods using linear interpolation vs. Gaussian smoothing.
result Linear interpolation yields better convergence rates and performance.
Study analyzes Airbnb booking lead times during global crises using a new metric.
problem Disruptions in booking behaviors during global crises affect forecasting accuracy.
method Normalized L1 (Manhattan) distance to assess lead time divergences.
result Identified two-phase disruption: abrupt change at pandemic onset followed by partial recovery.
Deep learning model classifies gastrointestinal diseases with high accuracy.
problem Disease detection in the gastrointestinal tract.
method Global features and deep neural networks.
result 95.80% accuracy, 95.87% precision, 95.80% F1-score.
This paper describes the system developed at Amobee for the WASSA 2018 implicit emotions shared task (IEST). The goal of this task was to predict the emotion expressed by missing words in tweets without an explicit mention of those words. We developed an ensemble system consisting of language models together with LSTM-…
This paper describes the participation of Amobee in the shared sentiment analysis task at SemEval 2018. We participated in all the English sub-tasks and the Spanish valence tasks. Our system consists of three parts: training task-specific word embeddings, training a model consisting of gated-recurrent-units (GRU) with …
New flaw found in SAP defense, reducing its effectiveness to 0.1%.
problem Weakness in Stochastic Activation Pruning defense against adversarial attacks.
method Re-examined the implementation of SAP and introduced a new BPDA attack.
result SAP's effectiveness reduced to 0.1% when properly applied.
We consider a team of reinforcement learning agents that concurrently operate in a common environment, and we develop an approach to efficient coordinated exploration that is suitable for problems of practical scale. Our approach builds on seed sampling (Dimakopoulou and Van Roy, 2018) and randomized value function lea…
This is a survey article, to appear in the Proceedings of the 2018 International Congress of Mathematicians. (Revised, with added and updated references.)
AutoML challenge solved lifelong learning problems without i.i.d. data.
problem Designing lifelong learning systems without independent and identically distributed data.
method Developed and evaluated machine learning programs using CodaLab platform.
result More than 300 participants competed and solved complex lifelong learning problems.
Cheap model diagnoses vocal disorders accurately.
problem Diagnosing vocal disorders without expensive equipment.
method Used Mel-Cepstrum vectors and Support Vector Machine.
result Accurately diagnosed three vocal disorders.
In this paper, we develop improved techniques for defending against adversarial examples at scale. First, we implement the state of the art version of adversarial training at unprecedented scale on ImageNet and investigate whether it remains effective in this setting - an important open scientific question (Athalye et …
Study uses satellite data to predict tailings dam collapse risk.
problem Detecting early signs of tailings dam instability.
method Spectral analysis of satellite InSAR displacement time series data.
result Algorithm detects risk milestones up to 5 months before dam collapse.
We show that finite-width deep ReLU neural networks yield rate-distortion optimal approximation (Bölcskei et al., 2018) of polynomials, windowed sinusoidal functions, one-dimensional oscillatory textures, and the Weierstrass function, a fractal function which is continuous but nowhere differentiable. Together with thei…
Orders and Fiberingmath.GR
Simpler proof for Kielak's virtual fibering criterion.
problem Virtual fibering criterion for RFRS groups
method Simpler proof
result Simplified proof of Kielak's criterion
This paper establishes lower bounds for smooth nonconvex finite-sum optimization.
problem Understanding the complexity of finding optimal solutions in nonconvex finite-sum optimization.
method Proving tight lower bounds for the complexity of finding ε-suboptimal points and ε-approximate stationary points.
result Existing algorithms achieve optimal IFO complexity up to logarithmic factors.
Classifies isotopy classes of links from Thompson's group F and its subgroup.
problem Classify isotopy classes of links from Thompson's group F and its subgroup.
method Introduced a method to produce links from elements of Thompson's group F and its subgroup.
result Classified isotopy classes of links from Thompson's group F and its subgroup.
High-dimensional ABCstat.CO
This Chapter, "High-dimensional ABC", is to appear in the forthcoming Handbook of Approximate Bayesian Computation (2018). It details the main ideas and concepts behind extending ABC methods to higher dimensions, with supporting examples and illustrations.
We re-examine and extend the findings from the recent paper by Dumitrescu, Quenez and Sulem (2018) who studied American and game options in a particular market model using the nonlinear arbitrage-free pricing approach developed in El Karoui and Quenez (1997). In the first part, we provide a detailed study of unilateral…
Proposes a stochastic model for South African actuarial use.
problem Long-term forecasting for South African institutions.
method Modeling economic series, estimating parameters, testing stability.
result Validated model for long-term forecasts.
Improved BERT model with latent persona and topic variables.
problem Improving BERT's domain-specific utility while maintaining generalization.
method Combining BERT with Universal Transformer, adding latent persona and topic variables.
result Pre-trained model for social texts outperforms baseline.
ES and FD gradients converge as optimization dimension grows.
problem Understanding the relationship between Evolution Strategies and Finite Differences gradients.
method Analyzing the convergence of gradients as the optimization dimension increases.
result ES and FD gradients converge as the dimension of the vector under optimization increases.
This Chapter, "Overview of Approximate Bayesian Computation", is to appear as the first chapter in the forthcoming Handbook of Approximate Bayesian Computation (2018). It details the main ideas and concepts behind ABC methods with many examples and illustrations.
On the fifth of February, 2018, the Dow Jones Industrial Average dropped 1,175.21 points, the largest single-day fall in history in raw point terms. This followed a 666-point loss on the second, and another drop of over a thousand points occurred three days later. It is natural to ask whether these events indicate a tr…
Forecasting directional movements of stock prices for intraday trading using LSTM and random forestscs.LG
The study uses LSTM and random forests to forecast stock price movements for intraday trading.
problem Forecasting directional movements of stock prices for intraday trading.
method Employed random forests and LSTM networks to analyze S&P 500 constituent stocks.
result Multi-feature setting provided higher daily returns (0.64% using LSTM, 0.54% using random forests) compared to single-feature setting.
Unsupervised machine translation---i.e., not assuming any cross-lingual supervision signal, whether a dictionary, translations, or comparable corpora---seems impossible, but nevertheless, Lample et al. (2018) recently proposed a fully unsupervised machine translation (MT) model. The model relies heavily on an adversari…
This short note aims to point out mistakes in one of the implications for Theorem 2.8 in Bayraktar and Yu [Mathematical Finance, 28 (2018), pp. 800-838], which weakens the statement of this theorem.
Bayesian linear regression on neural network representations handles both homoscedastic and heteroscedastic noise.
problem Uncertainty in neural network predictions, especially with heteroscedastic noise.
method Proposes a novel Bayesian linear regression approach to model heteroscedastic noise in neural network representations.
result The method outperforms standard ensembling and other methods in model-based reinforcement learning.
A 2018 paper proves a unique 4-manifold with a boundary homotopy equivalent to a sphere but no simplicial embedding.
problem Existence of a specific type of embedding in a 4-manifold.
method Proof of existence of a 4-manifold with boundary homotopy equivalent to a sphere but no simplicial embedding.
result A compact smooth 4-manifold with boundary homotopy equivalent to a sphere but no simplicial embedding.
DAIS improves AIS by resampling, avoiding gradient issues.
problem Low effective sample size in DAIS.
method DAIS with resampling step to improve efficiency.
result Resampling step avoids gradient variance issues.
These are the lecture notes for the summer course given for 2018 Mathematical Finance Summer School at Shandong Unversity. It contains a brief introduction to the Kyle model and the related topics in filtering, enlargement of filtrations and Markov bridges.
ABC Samplersstat.CO
This Chapter, "ABC Samplers", is to appear in the forthcoming Handbook of Approximate Bayesian Computation (2018). It details the main ideas and algorithms used to sample from the ABC approximation to the posterior distribution, including methods based on rejection/importance sampling, MCMC and sequential Monte Carlo.
Improves deep learning theory by reducing over-parametrization size.
problem Deep learning theory over-parametrization issues.
method Used Matrix Chernoff Bound to improve over-parametrization size.
result Improved over-parametrization size over previous results.
This project applies Mask R-CNN method to ISIC 2018 challenge tasks: lesion boundary segmentation (task1), lesion attributes detection (task 2), lesion diagnosis (task 3), a solution to the latter is using a trained model for task 1 and a simple voting procedure.