5,427 research outputs found

    Agent Behavior Prediction and Its Generalization Analysis

    Full text link
    Machine learning algorithms have been applied to predict agent behaviors in real-world dynamic systems, such as advertiser behaviors in sponsored search and worker behaviors in crowdsourcing. The behavior data in these systems are generated by live agents: once the systems change due to the adoption of the prediction models learnt from the behavior data, agents will observe and respond to these changes by changing their own behaviors accordingly. As a result, the behavior data will evolve and will not be identically and independently distributed, posing great challenges to the theoretical analysis on the machine learning algorithms for behavior prediction. To tackle this challenge, in this paper, we propose to use Markov Chain in Random Environments (MCRE) to describe the behavior data, and perform generalization analysis of the machine learning algorithms on its basis. Since the one-step transition probability matrix of MCRE depends on both previous states and the random environment, conventional techniques for generalization analysis cannot be directly applied. To address this issue, we propose a novel technique that transforms the original MCRE into a higher-dimensional time-homogeneous Markov chain. The new Markov chain involves more variables but is more regular, and thus easier to deal with. We prove the convergence of the new Markov chain when time approaches infinity. Then we prove a generalization bound for the machine learning algorithms on the behavior data generated by the new Markov chain, which depends on both the Markovian parameters and the covering number of the function class compounded by the loss function for behavior prediction and the behavior prediction model. To the best of our knowledge, this is the first work that performs the generalization analysis on data generated by complex processes in real-world dynamic systems

    Efficient Inexact Proximal Gradient Algorithm for Nonconvex Problems

    Full text link
    The proximal gradient algorithm has been popularly used for convex optimization. Recently, it has also been extended for nonconvex problems, and the current state-of-the-art is the nonmonotone accelerated proximal gradient algorithm. However, it typically requires two exact proximal steps in each iteration, and can be inefficient when the proximal step is expensive. In this paper, we propose an efficient proximal gradient algorithm that requires only one inexact (and thus less expensive) proximal step in each iteration. Convergence to a critical point %of the nonconvex problem is still guaranteed and has a O(1/k)O(1/k) convergence rate, which is the best rate for nonconvex problems with first-order methods. Experiments on a number of problems demonstrate that the proposed algorithm has comparable performance as the state-of-the-art, but is much faster

    Recent Advances about Local Gene Delivery by Ultrasound

    Get PDF
    Gene therapy has been widely explored as a pharmacological approach, with a great potential to treat various diseases. Generally, many diseases have definite lesion’s site, especially for tumors. This feature results in a great demand on the delivery of therapeutic gene to the local lesion’s site. Ultrasound combined with microbubbles provides a promising platform to deliver gene in a spatiotemporally controlled way. Ultrasound beam can be positioned and targeted onto the deep-seated lesion’s site of diseases by an external mobile transducer. Microbubbles can serve as vehicles for carrying genetic cargo and can be destructed by ultrasound, resulting in the local release of genetic payload. Meanwhile, sonoporation effect will occur upon which the bubbles are exposed to the appropriate ultrasonic energy, producing the transient small holes on the adjacent cell membrane and thus increasing the vascular and cellular permeability. In this chapter, we will review the recent advances about local gene delivery by ultrasound
    • …
    corecore